Sciweavers

868 search results - page 77 / 174
» A general compression algorithm that supports fast searching
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 9 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
ICML
2005
IEEE
14 years 9 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
WWW
2008
ACM
14 years 9 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
MSV
2004
13 years 10 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ATAL
2006
Springer
14 years 23 days ago
Multi-agent based peer-to-peer information retrieval systems with concurrent search sessions
In cooperative peer-to-peer information retrieval systems, each node can be considered an intelligent agent and these agents work collectively to provide an information retrieval ...
Haizheng Zhang, Victor R. Lesser