Sciweavers

102291 search results - page 20439 / 20459
» Computability in Computational Geometry
Sort
View
SIGIR
2012
ACM
12 years 5 days ago
An uncertainty-aware query selection model for evaluation of IR systems
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
Mehdi Hosseini, Ingemar J. Cox, Natasa Milic-Frayl...
SIGIR
2012
ACM
12 years 5 days ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
SIGIR
2012
ACM
12 years 5 days ago
Explicit relevance models in intent-oriented information retrieval diversification
The intent-oriented search diversification methods developed in the field so far tend to build on generative views of the retrieval system to be diversified. Core algorithm compon...
Saul Vargas, Pablo Castells, David Vallet
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
12 years 5 days ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
12 years 5 days ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
« Prev « First page 20439 / 20459 Last » Next »