2100 search results - page 197 / 420 » Learning to rank on graphs |
208
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
197
click to vote
TSP
2011
15 years 1 months ago
2011
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
211
click to vote
ALT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
202
click to vote
IJCV
2011
15 years 1 months ago
2011
Abstract We present an active learning framework that predicts the tradeoff between the effort and information gain associated with a candidate image annotation, thereby ranking un...
220
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...