Sciweavers

2324 search results - page 139 / 465
» A Fast Keyword-Spotting Technique
Sort
View
ICFP
2005
ACM
16 years 12 days ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
ICALP
2005
Springer
16 years 11 days ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
PKDD
2005
Springer
159views Data Mining» more  PKDD 2005»
16 years 10 days ago
Fast Burst Correlation of Financial Data
We examine the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. Our methodology is comprised of two steps: a burst dete...
Michail Vlachos, Kun-Lung Wu, Shyh-Kwei Chen, Phil...
CAV
2004
Springer
108views Hardware» more  CAV 2004»
16 years 7 days ago
DPLL( T): Fast Decision Procedures
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
Harald Ganzinger, George Hagen, Robert Nieuwenhuis...
CC
2004
Springer
160views System Software» more  CC 2004»
16 years 7 days ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula