Sciweavers

354 search results - page 61 / 71
» Approximate String Joins
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 8 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CIKM
2008
Springer
15 years 6 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
JCC
2010
113views more  JCC 2010»
15 years 2 months ago
MDLab: A molecular dynamics simulation prototyping environment
Molecular dynamics (MD) simulation involves solving Newton’s equations of motion for a system of atoms, by calculating forces and updating atomic positions and velocities over a...
Trevor M. Cickovski, Santanu Chatterjee, Jacob Wen...
APLAS
2009
ACM
15 years 10 months ago
Large Spurious Cycle in Global Static Analyses and Its Algorithmic Mitigation
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
Hakjoo Oh
ISM
2008
IEEE
119views Multimedia» more  ISM 2008»
15 years 10 months ago
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs
Cover song detection is becoming a very hot research topic when plentiful personal music recordings or performance are released on the Internet. A nice cover song recognizer helps...
Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei...