Sciweavers

7215 search results - page 239 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
SIGIR
2010
ACM
14 years 5 days ago
Studying trailfinding algorithms for enhanced web search
Search engines return ranked lists of Web pages in response to queries. These pages are starting points for post-query navigation, but may be insufficient for search tasks involvi...
Adish Singla, Ryen White, Jeff Huang
DAM
2010
137views more  DAM 2010»
13 years 8 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
SARA
2009
Springer
14 years 25 days ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
BTW
2007
Springer
131views Database» more  BTW 2007»
14 years 9 days ago
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
JMLR
2012
11 years 10 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola