Sciweavers

491 search results - page 35 / 99
» Ranking Abstractions
Sort
View
EJC
2008
13 years 8 months ago
Graph parameters and semigroup functions
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
László Lovász, Alexander Schr...
SCL
2008
109views more  SCL 2008»
13 years 8 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
IR
2010
13 years 7 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
ECCV
1994
Springer
14 years 10 months ago
Non-parametric Local Transforms for Computing Visual Correspondence
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
Ramin Zabih, John Woodfill
ECIR
2009
Springer
14 years 5 months ago
Using Multiple Query Aspects to Build Test Collections without Human Relevance Judgments
Abstract. Collecting relevance judgments (qrels) is an especially challenging part of building an information retrieval test collection. This paper presents a novel method for crea...
Miles Efron