Publications

Export 7151 results:
Author [ Title(Asc)] 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
Liang J, DeMenthon D, Doermann D.  2005.  Flattening curved documents in images. Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on. 2:338-345vol.2-338-345vol.2.
Edu CU, Purang K, Purushothaman D, Traum D, Andersen C, Perlis D.  1999.  Fkpurang, darsana, traum, cfa, perlisg@ cs. umd. edu. In Proceedings of the IJCAI’99 Workshop on Practical Reasoning and Rationality.
Pugh W.  1999.  Fixing the Java memory model. Proceedings of the ACM 1999 conference on Java Grande. :89-98.
Bender A, Sherwood R, Spring N.  2008.  Fixing ally's growing pains with velocity modeling. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement. :337-342.
Ramachandran A, Feamster N, Krishnamurthy B, Spatscheck O, Van der Merwe J.  2008.  Fishing for Phishing from the Network Stream. GT-CS-08-08
Card SK, Mackinlay JD, Shneiderman B.  1999.  Fisheye views. Readings in information visualizationReadings in information visualization. :311-311.
Jordan PW, Dorr BJ, Benoit JW.  1993.  A first-pass approach for evaluating machine translation systems. Machine Translation. 8(1):49-58.
Shneiderman B.  1993.  First steps toward positive contributions. Communications of the ACM. 36(1):15-16.
Haibin G A, Agarwal G, Ling H, Jacobs DW, Shirdhonkar S, Kress JW, Russell R, Belhumeur P, Dixit A, Feiner S et al..  2006.  First Steps Toward an Electronic Field Guide for Plants. Taxon. 55:597-610.
Bonsignore EM, Dunne C, Rotman D, Smith M, Capone T, Hansen DL, Shneiderman B.  2009.  First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL. International Conference on Computational Science and Engineering, 2009. CSE '09. 4:332-339.
Wagner D, Foster JS, Brewer EA, Aiken A.  2000.  A first step towards automated detection of buffer overrun vulnerabilities. The 2000 Network and Distributed Systems Security Conference. San Diego, CA. 14
Balog K, de Vries AP, Serdyukov P, Wen J-R.  2012.  The first international workshop on entity-oriented search (EOS). SIGIR Forum. 45(2):43-50.
Hale K, Keyser SJ, Hutchins WJ, Habash N, Dorr BJ, Traum D.  2005.  Finite-State Language resources and Language Processing. Machine Translation. 18:381-382.
Brauer JR, Mayergoyz ID.  2004.  Finite-element computation of nonlinear magnetic diffusion and its effects when coupled to electrical, mechanical, and hydraulic systems. Magnetics, IEEE Transactions on. 40(2):537-540.
Elman H, Silvester DJ, Wathen AJ.  2005.  Finite Elements and Fast Iterative Solvers : with Applications in Incompressible Fluid Dynamics. :416.
Nagarajan N, Cook C, Di Bonaventura M P, Ge H, Richards A, Bishop-Lilly KA, DeSalle R, Read TD, Pop M.  2010.  Finishing genomes with limited resources: lessons from an ensemble of microbial genomes. BMC Genomics. 11(1):242-242.
Gou H, Wu M.  2006.  Fingerprinting digital elevation maps. Proceedings of SPIE. 6072:373-384.
Gou H, Wu M.  2005.  Fingerprinting curves. Digital Watermarking. :13-28.
Varna AL, He S, Swaminathan A, M. Wu.  2009.  Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 4(3):330-345.
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.

Pages