Sciweavers

671 search results - page 60 / 135
» Research proposal for distributed deep web search
Sort
View
CPAIOR
2008
Springer
15 years 2 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
SIGIR
2012
ACM
13 years 3 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
EDBT
2008
ACM
161views Database» more  EDBT 2008»
16 years 23 days ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
99
Voted
WWW
2005
ACM
16 years 1 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
120
Voted
WWW
2006
ACM
16 years 1 months ago
POLYPHONET: an advanced social network extraction system from the web
Social networks play important roles in the Semantic Web: knowledge management, information retrieval, ubiquitous computing, and so on. We propose a social network extraction syst...
Hideaki Takeda, Junichiro Mori, Kôiti Hasida...