Sciweavers

1261 search results - page 111 / 253
» Approximation algorithms for aligning points
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
ISMB
1996
14 years 11 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
ECCV
2002
Springer
15 years 11 months ago
Video Compass
Abstract. In this paper we describe a flexible approach for determining the relative orientation of the camera with respect to the scene. The main premise of the approach is the fa...
Jana Kosecká, Wei Zhang
ICML
2003
IEEE
15 years 10 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
CCCG
2007
14 years 11 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin