Sciweavers

1461 search results - page 69 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
95
Voted
SIGIR
2008
ACM
14 years 11 months ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...
HEURISTICS
2000
90views more  HEURISTICS 2000»
14 years 11 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
NETWORKS
2007
14 years 11 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
SIGIR
2008
ACM
14 years 10 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
16 years 1 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias