Sciweavers

4337 search results - page 211 / 868
» Cache-Oblivious Query Processing
Sort
View
SIGIR
2003
ACM
15 years 11 months ago
Query length in interactive information retrieval
Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactiv...
Nicholas J. Belkin, Diane Kelly, G. Kim, Ja-Young ...
LRE
2006
175views more  LRE 2006»
15 years 6 months ago
Automatically generating related queries in Japanese
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
Rosie Jones, Kevin Bartz, Pero Subasic, Benjamin R...
CIKM
2009
Springer
16 years 28 days ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
167
Voted
IPPS
2008
IEEE
16 years 23 days ago
Towards feasibility and scalability of text search in peer-to-peer systems
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
A. Lal, V. Gupta, Khaled Harfoush, Injong Rhee
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
16 years 12 days ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...