Sciweavers

2654 search results - page 258 / 531
» On Pairing Inversion Problems
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Rank Aggregation: Together We're Strong
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...
Frans Schalekamp, Anke van Zuylen
ICIP
2005
IEEE
16 years 8 months ago
The multiRANSAC algorithm and its application to detect planar homographies
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...
Marco Zuliani, Charles S. Kenney, B. S. Manjunath
ICPR
2008
IEEE
16 years 7 months ago
On efficient Viterbi decoding for hidden semi-Markov models
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...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
ICPR
2006
IEEE
16 years 7 months ago
Bijective Image Registration using Thin-Plate Splines
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...
ALT
2008
Springer
16 years 3 months ago
Smooth Boosting for Margin-Based Ranking
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...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...