Publications

Export 292 results:
Author [ Title(Asc)] Type Year
Filters: First Letter Of Title is F  [Clear All Filters]
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
Kim K, Davis LS.  2004.  A fine-structure image/video quality measure using local statistics. Image Processing, 2004. ICIP '04. 2004 International Conference on. 5:3535-3538Vol.5-3535-3538Vol.5.
Varshney A, Kaufman A.  1996.  FINESSE: a financial information spreadsheet. Information Visualization '96, Proceedings IEEE Symposium on. :70-71,125-70-71,125.
Jimmy Lin.  2004.  Fine-grained lexical semantic representations and compositionally-derived events in Mandarin Chinese. Proceedings of the HLT-NAACL Workshop on Computational Lexical Semantics. :100-107.
O'Leary DP.  1987.  Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
Mahesh R, Rangan C.P, Srinivasan A.  1991.  On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2):218-224.
Shiloach Y, Vishkin U.  1981.  Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
Yao Z, Gupta SK, Nau DS.  2000.  Finding the maximal cutter for 2-D milling operations. :10-13.
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.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
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.
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.
Priyadarshi A, Gupta SK.  2006.  Finding Mold-Piece Regions Using Computer Graphics Hardware. Geometric Modeling and Processing - GMP 2006. 4077:655-662.
Schieber B, Vishkin U.  1988.  On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
Berkman O, Vishkin U.  1994.  Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.
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.
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.
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.
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.
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.
Marchionini G, Shneiderman B.  1993.  Finding facts vs. browsing knowledge in hypertext systems. Sparks of innovation in human-computer interaction. :103-103.
Marchionini G, Shneiderman B.  1988.  Finding facts vs. browsing knowledge in hypertext systems. Computer. 21(1):70-80.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
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.
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.

Pages