Sciweavers

868 search results - page 91 / 174
» A general compression algorithm that supports fast searching
Sort
View
139
Voted
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 3 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
146
Voted
DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
15 years 7 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
141
Voted
WWW
2008
ACM
16 years 4 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
138
Voted
ICMLA
2003
15 years 5 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
122
Voted
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
15 years 10 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush