Journal Articles

(Publications are listed alphabetically by title)

Pages

Elman H, Silvester D. Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations. SIAM Journal on Scientific Computing. 1996;17(1):33-46.

Raykar VC, Duraiswami R. Fast optimal bandwidth selection for kernel density estimation. Proceedings of the sixth SIAM International Conference on Data Mining. 2006:524-528.

Landau GM, Vishkin U. Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 1989;10(2):157-169.

Gumerov NA, Duraiswami R. Fast radial basis function interpolation via preconditioned Krylov iteration. SIAM Journal on Scientific Computing. 2010;29(5):1876.

Mastronardi N, O'Leary DP. Fast Robust Regression Algorithms for Problems with Toeplitz Structure. Computational Statistics and Data Analysis. 2007;52:2:1119-1131.

Daumé H. Fast search for Dirichlet process mixture models. Arxiv preprint arXiv:0907.1812. 2009.

Shuttleworth RR, Elman H, Long KR, Templeton JA. Fast solvers for models of ICEO microfluidic flows. International Journal for Numerical Methods in Fluids. 2011;65(4):383-404.

Landau GM, Vishkin U. Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 1988;37(1):63-78.

Landau GM, Vishkin U. Fast string matching with k differences. J. COMP. SYST. SCI.. 1988;37(1):63-78.

Larson E, Froehlich J, Campbell T, Haggerty C, Atlas L, Fogarty J, et al. Fast track article: Disaggregated water sensing from a single, pressure-based sensor: An extended analysis of HydroSense using staged experiments. Pervasive Mob. Comput.. 2012;8(1):82-102.

Liu H, Chellappa R, Rosenfeld A. Fast two-frame multiscale dense optical flow estimation using discrete wavelet filters. Journal of the Optical Society of America AJ. Opt. Soc. Am. A. 2003;20(8):1505-1515.

Raykar VC, Duraiswami R, Krishnapuram B. Fast weighted summation of erfc functions. Technical Reports from UMIACS UMIACS-TR-2007-03. 2007.

Cole R, Vishkin U. Faster optimal parallel prefix sums and list ranking. Information and Computation. 1989;81(3):334-352.

Huang Y, Evans D, Katz J, Malka L. Faster secure two-party computation using garbled circuits. USENIX Security Symposium. 2011.

Khuller S, Pless R, Sussmann YJ. Fault tolerant K-center problems. Theoretical Computer Science. 2000;242(1–2):237-245.

Baykal N, Reogia JA, Yalabik N, Erkmen A, Beksac M. Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms. Computers in Biology and Medicine. 1996;26(6):451-462.

Dogan RI, Getoor L, Wilbur JW, Mount SM. Features generated for computational splice-site prediction correspond to functional elements. BMC Bioinformatics. 2007;8(1):410.

Cummings MP, Segal MR. Few amino acid positions in ıt rpoB are associated with most of the rifampin resistance in ıt Mycobacterium tuberculosis. BMC Bioinformatics. 2004;5:137.

White J, Roberts M, Yorke JA, Pop M. Figaro: A Novel Statistical Method for Vector Sequence Removal. Bioinformatics. 2008;24(4):462-467.

Shneiderman B. Fighting for the User. Bulletin of the American Society for Information ScienceBulletin of the American Society for Information Science. 1982;9(2):27-29.

Shneiderman B, Bederson BB, Drucker SM. Find that photo!: interface strategies to annotate, browse, and share. Communications of the ACM - Supporting exploratory search. 2006;49(4):69-71.

Schieber B, Vishkin U. Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 1990;29(1):97-111.

Navlakha S, White JR, Nagarajan N, Pop M, Kingsford C. Finding Biologically Accurate Clusterings in Hierarchical Decompositions Using the Variation of Information. Lecture Notes in Computer Science: Research in Computational Molecular Biology. 2009;5541:400-417.

Navlakha S, White J, Nagarajan N, Pop M, Kingsford C. Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. Journal of Computational Biology. 2010;17(3):503-516.

Hovemeyer D, Pugh W. Finding bugs is easy. ACM SIGPLAN NoticesSIGPLAN Not.. 2004;39(12):92.

Atallah M, Vishkin U. Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 1984;29(3):330-337.

Marchionini G, Shneiderman B. Finding facts vs. browsing knowledge in hypertext systems. Sparks of innovation in human-computer interaction. 1993:103.

Marchionini G, Shneiderman B. Finding facts vs. browsing knowledge in hypertext systems. Computer. 1988;21(1):70-80.

Ceaparu I, Shneiderman B. 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. 2004;55(11):1008-1015.

Ceaparu I, Shneiderman B. 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. 2004;55:1008-1015.

Berkman O, Vishkin U. Finding level-ancestors in trees. Journal of Computer and System Sciences. 1994;48(2):214-230.

Khuller S, Martinez V, Nau DS, Simari G, Sliva A, Subrahmanian V. Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. 2007:45-59.

Shiloach Y, Vishkin U. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 1981;2(1):88-102.

Varna AL, He S, Swaminathan A, M. Wu. Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 2009;4(3):330-345.

Gou H, Wu M. Fingerprinting curves. Digital Watermarking. 2005:13-28.

Gou H, Wu M. Fingerprinting digital elevation maps. Proceedings of SPIE. 2006;6072:373-384.

Nagarajan N, Cook C, Di Bonaventura M, Ge H, Richards A, Bishop-Lilly KA, et al. Finishing genomes with limited resources: lessons from an ensemble of microbial genomes. BMC Genomics. 2010;11(1):242.

Brauer JR, Mayergoyz ID. Finite-element computation of nonlinear magnetic diffusion and its effects when coupled to electrical, mechanical, and hydraulic systems. Magnetics, IEEE Transactions on. 2004;40(2):537-540.

Hale K, Keyser SJ, Hutchins WJ, Habash N, Dorr BJ, Traum D. Finite-State Language resources and Language Processing. Machine Translation. 2005;18:381-382.

Haibin G, Agarwal G, Ling H, Jacobs DW, Shirdhonkar S, Kress JW, et al. First Steps Toward an Electronic Field Guide for Plants. Taxon. 2006;55:597-610.

Shneiderman B. First steps toward positive contributions. Communications of the ACM. 1993;36(1):15-16.

Li Z, Duraiswami R. Flexible and Optimal Design of Spherical Microphone Arrays for Beamforming. Audio, Speech, and Language Processing, IEEE Transactions on. 2007;15(2):702-714.

Jajodia S, Samarati P, Sapino M, V.S. Subrahmanian. Flexible support for multiple access control policies. ACM Trans. Database Syst.. 2001;26(2):214-260.

Khuller S, Naor J. Flow in planar graphs with vertex capacities. Algorithmica. 1994;11(3):200-225.

Foster JS, Johnson R, Kodumal J, Aiken A. Flow-insensitive type qualifiers. ACM Transactions on Programming Languages and Systems (TOPLAS). 2006;28(6):1035-1087.

Foster JS, Terauchi T, Aiken A. Flow-sensitive type qualifiers. ACM SIGPLAN Notices. 2002;37(5):1-12.

Nassi I, Shneiderman B. Flowchart techniques for structured programming. ACM SIGPLAN Notices. 1973;8(8):12-26.

Zhao HV, M. Wu, Wang ZJ, Liu KJ. Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting. Image Processing, IEEE Transactions on. 2005;14(5):646-661.

Lu W, Varna AL, Wu M. Forensic hash for multimedia information. SPIE Media Forensics and Security. 2010:7541-0Y - 7541-0Y.

Tse C, Krafft C, Mayergoyz ID, McAvoy P, Tseng C-. Forensic recovery of hard disk data by using the spin-stand imaging technique. Proceedings of SPIE. 2005;5778(1):595-606.