Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
Vishkin RETU.  1984.  Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
Navlakha S, White JR, Nagarajan N, Pop M, Kingsford C.  2009.  Finding Biologically Accurate Clusterings in Hierarchical Decompositions Using the Variation of Information. Lecture Notes in Computer Science: Research in Computational Molecular Biology. 5541:400-417.
Navlakha S, White J, Nagarajan N, Pop M, Kingsford C.  2009.  Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. Research in Computational Molecular Biology. 5541:400-417.
Navlakha S, White J, Nagarajan N, Pop M, Kingsford C.  2010.  Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. Journal of Computational Biology. 17(3):503-516.
Hovemeyer D, Pugh W.  2004.  Finding bugs is easy. ACM SIGPLAN NoticesSIGPLAN Not.. 39(12):92-92.
Kommareddy C, Shankar N, Bhattacharjee B.  2001.  Finding close friends on the Internet. Network Protocols, 2001. Ninth International Conference on. :301-309.
Wongsuphasawat K, Shneiderman B.  2009.  Finding comparable temporal categorical records: A similarity measure with an interactive visualization. IEEE Symposium on Visual Analytics Science and Technology, 2009. VAST 2009. :27-34.
Hovemeyer D, Pugh W.  2004.  Finding concurrency bugs in java. Proceedings of the PODC Workshop on Concurrency and Synchronization in Java Programs, St. John's, Newfoundland, Canada.
Chrun D, Cukier M, Sneeringer G.  2008.  Finding Corrupted Computers Using Imperfect Intrusion Prevention System Event Data. Computer Safety, Reliability, and Security. 5219:221-234.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Marchionini G, Shneiderman B.  1988.  Finding facts vs. browsing knowledge in hypertext systems. Computer. 21(1):70-80.
Marchionini G, Shneiderman B.  1993.  Finding facts vs. browsing knowledge in hypertext systems. Sparks of innovation in human-computer interaction. :103-103.
Ran Y, Chellappa R, Zheng Q.  2006.  Finding Gait in Space and Time. Pattern Recognition, 2006. ICPR 2006. 18th International Conference on. 4:586-589.
Ceaparu I, Shneiderman B.  2004.  Finding governmental statistical data on the Web: A study of categorically organized links for the FedStats topics page. Journal of the American Society for Information Science and Technology. 55(11):1008-1015.
Ceaparu I, Shneiderman B.  2004.  Finding Governmental Statistical Data on the Web: Three Empirical Studies of the FedStats Topics Page. Journal of the American Society for Information Science and Technology. 55:1008-1015.
Ceaparu I, Shneiderman B.  2005.  Finding Governmental Statistical Data on the Web: Three Empirical Studies of the FedStats Topics Page (2003). Institute for Systems Research Technical Reports.
Shachnai H, Srinivasan A.  2001.  Finding large independent sets of hypergraphs in parallel. Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures. :163-168.
Pugh W, Kelly W.  1995.  Finding Legal Reordering Transformations using Mappings. Languages and compilers for parallel computing: 7th International Workshop, Ithaca, NY, USA, August 8-10, 1994: proceedings. 7:107-107.
Berkman O, Vishkin U.  1994.  Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.
Schieber B, Vishkin U.  1988.  On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
Priyadarshi A, Gupta SK.  2006.  Finding Mold-Piece Regions Using Computer Graphics Hardware. Geometric Modeling and Processing - GMP 2006. 4077:655-662.
Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V.  2007.  Finding Most Probable Worlds of Probabilistic Logic Programs. Scalable Uncertainty Management. 4772:45-59.
Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V.  2007.  Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Jacobs DW, Chennubhotla C.  1994.  Finding structurally consistent motion correspondences. Pattern Recognition, 1994. Vol. 1 - Conference A: Computer Vision Image Processing., Proceedings of the 12th IAPR International Conference on. 1:650-653vol.1-650-653vol.1.

Pages