491 search results - page 19 / 99 » Ranking Abstractions |
WEBI
2009
Springer
14 years 3 months ago
2009
Springer
Abstract—This paper introduces and analyzes a new approach to query suggestion. After the user issues a query q0, for every document retrieved in a certain rank range [Θ1, Θ2],...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising i...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...