Publications

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

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

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

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

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

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

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

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

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

Anwer MB, Feamster N. 2009. A Fast, Virtualized Data Plane for the NetFPGA. NetFPGA Developers Workshop, Stanford, California. :90-94.

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

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

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

Dumitras T, Kavulya S, Narasimhan P. 2008. A Fault Model for Upgrades in Distributed Systems (CMU-PDL-08-115). Parallel Data Laboratory.

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

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

Islamaj R, Getoor L, Wilbur W. 2006. A feature generation algorithm for sequences with application to splice-site prediction. Knowledge Discovery in Databases: PKDD 2006. :553-560.

Dogan RI, Getoor L, Wilbur WJ. 2008. A Feature Generation Algorithm with Applications to Biological Sequence Classification. Computational Methods. :355-355.

Dhaliwal S, Gupta SK, Huang J, Kumar M. 2001. A feature-based approach to automated design of multi-piece sacrificial molds. Journal of Computing and Information Science in Engineering. 1:225-225.

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

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

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

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

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

Megiddo N, Vishkin U. 1988. On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.

Pages

Publications