1871 search results - page 118 / 375 » The Ephemeral Pairing Problem |
ALENEX
2009
14 years 9 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
ICPR
2008
IEEE
16 years 19 days ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
ICPR
2006
IEEE
16 years 16 days ago
2006
IEEE
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...
106
click to vote
ALT
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...