Sciweavers

306 search results - page 31 / 62
» Parameterized matching with mismatches
Sort
View
ICMCS
2007
IEEE
76views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Whispering Speaker Identification
This paper describes a study of automatically identifying whispering speakers. People usually whisper in order to avoid being identified or overheard by lowering their voices. Th...
Qin Jin, Szu-Chen Stan Jou, Tanja Schultz
FCT
2003
Springer
14 years 1 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
ICSE
2010
IEEE-ACM
14 years 23 days ago
Exemplar: EXEcutable exaMPLes ARchive
Searching for applications that are highly relevant to development tasks is challenging because the high-level intent reflected in the descriptions of these tasks doesn’t usual...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
FASE
2001
Springer
14 years 14 days ago
Debugging via Run-Time Type Checking
This paper describes the design and implementation of a tool for C programs that provides run-time checks based on type information. The tool instruments a program to monitor the t...
Alexey Loginov, Suan Hsi Yong, Susan Horwitz, Thom...
ESOP
2010
Springer
14 years 3 hour ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers