Periodicity, directionality, and randomness: Wold features for.. - Liu, Picard (1994)(Correct)(24 citations)
A human texture perception study conducted by Rao and Lohse [1] indicated that the three most
dominate the perceptual pattern discrimination. By Rao and Lohse [1]the existence of periodic structure
orientation in texture. References 1] A. R. Rao and G. L. Lohse. Towards a texture naming system: www-white.media.mit.edu/vismod/publications/techdir/TR-293.ps.Z
Protein Structure Alignment Using a Graph Matching Technique - Akutsu (1995)(Correct)
protein structure alignment [6, 7, 9, 10, 12, 13]Rao and Rossmann, and Pascarella and Argos proposed
Engineering, Vol. 5, pp. 121-137, 1992. 10] S. T. Rao and M. G. Rossmann, Comparison of super-secondary www.genome.ad.jp/manuscripts/GIW95/Oral/GIW95O01.ps
Adding Imageability Features to. . . - Chalmers, Ingram, al. (1996)(Correct)
acknowledged, and I also offer thanks to Ramana Rao whose discussion and comment helped greatly.
1991)ACM, 1991, pp. 173-180. 18. MacKinlay, J.D.Rao, R. Card, S.K. An Organic User Interface for www.ubs.com/e/index/about/ubilab/print_versions/ps/cha96d.ps.gz
Reconfiguring Arrays with Faults Part I: Worst-Case Faults - Cole, Maggs, Sitaraman (1997)(Correct)(6 citations)
the corresponding path in H. Leighton, Maggs, and Rao [11] showed that if the embedding has load l,
F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically
October 1990. 9] R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg. Work-preserving emulations of www.cs.cmu.edu/afs/cs.cmu.edu/project/phrensy/pub/papers/compressed/ColeMS94.ps.gz
Active Contours For Lipreading - Combining Snakes With Templates - Horbelt, Dugelay (1995)(Correct)(2 citations)
[YUI92, HUA92] and apply it to lipreading [HEN94, RAO94]Yuhas [YUI92] and Rao [RAO94] use parabolas
it to lipreading [HEN94, RAO94]Yuhas [YUI92] and Rao [RAO94] use parabolas for the lip contours. Huang
to lipreading [HEN94, RAO94]Yuhas [YUI92] and Rao [RAO94] use parabolas for the lip contours. Huang uses bigwww.epfl.ch/horbelt/papers/SBH95.gretsi.ps.gz
Geometric Shortest Paths and Network Optimization - Mitchell (1998)(Correct)(39 citations)
Exploiting planarity, Henzinger, Klein, and Rao [198] have obtained a linear-time algorithm for
In a very recent improvement to these results, Rao and Smith [332] obtain an O(n log n) time
1985. 198] M. R. Henzinger, P. Klein, and S. Rao. Faster shortest-path algorithms for planar ams.sunysb.edu/pub/geometry/survey-sp.ps.gz