Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
Filters: Efficient-model-checking-buchi-tableau-automata%E2%8B%86 is   [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
Gumerov NA, Duraiswami R.  2010.  Fast radial basis function interpolation via preconditioned Krylov iteration. SIAM Journal on Scientific Computing. 29(5):1876-1876.
Panconesi A, Srinivasan A.  1992.  Fast randomized algorithms for distributed edge coloring. Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. :251-262.
Mastronardi N, O'Leary DP.  2007.  Fast Robust Regression Algorithms for Problems with Toeplitz Structure. Computational Statistics and Data Analysis. 52:2:1119-1131.
Kumar J, Doermann D.  2011.  Fast Rule-line Removal using Integral Images and Support Vector Machines. Intl. Conf. on Document Analysis and Recognition (ICDAR 11). :584-588.
Arya S, Phamdo N, Farvardin N, Mount D.  1993.  Fast search algorithms with applications to split and multi-stage vector quantization of speech lsp parameters. Speech Coding for Telecommunications, 1993. Proceedings., IEEE Workshop on. :65-66.
Daumé H.  2009.  Fast search for Dirichlet process mixture models. Arxiv preprint arXiv:0907.1812.
Lieberman MD, Sankaranarayanan J, Samet H.  2008.  A Fast Similarity Join Algorithm Using Graphics Processing Units. Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on. :1111-1120.
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.
Berman P, Hannenhalli S.  1996.  Fast sorting by reversal. Combinatorial Pattern MatchingCombinatorial Pattern Matching. 1075:168-185.
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.
Li Z, Duraiswami R.  2007.  Fast Time-Domain Spherical Microphone Array Beamforming. Applications of Signal Processing to Audio and Acoustics, 2007 IEEE Workshop on. :155-158.
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.
McMaster S, Memon AM.  2007.  Fault Detection Probability Analysis for Coverage-Based Test Suite Reduction. Software Maintenance, 2007. ICSM 2007. IEEE International Conference on. :335-344.
Cukier M, Chandra R, Henke D, Pistole J, Sanders WH.  1999.  Fault injection based on a partial view of the global state of a distributed system. :168-177.
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.
Levi S-T, Agrawala AK.  1994.  Fault tolerant system design. :440.
Strecker J, Memon AM.  2007.  Faults' context matters. Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting. :112-115.
Byrka J, Srinivasan A, Swamy C.  2010.  Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:244-257.

Pages