Sciweavers

7215 search results - page 83 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 2 months ago
Finding Branch-Decompositions and Rank-Decompositions
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...
Petr Hlinený, Sang-il Oum
CP
2008
Springer
13 years 9 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...
CGF
2000
81views more  CGF 2000»
13 years 7 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong
CP
2010
Springer
13 years 6 months ago
Domain Consistency with Forbidden Values
This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the op...
Yves Deville, Pascal Van Hentenryck
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
13 years 8 months ago
Direct Optimization of Evaluation Measures in Learning to Rank Using Particle Swarm
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
Ósscar Alejo, Juan M. Fernández-Luna...