Sciweavers

52 search results - page 11 / 11
» A comparison of tight generalization error bounds
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 5 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...