Sciweavers

1272 search results - page 150 / 255
» The Set Cover with Pairs Problem
Sort
View
CSC
2006
14 years 1 days ago
Minimal Enclosing Circle and Two and Three Point Partition of a Plane
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
Felix Friedman
CGF
2008
148views more  CGF 2008»
13 years 10 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker
EOR
2006
110views more  EOR 2006»
13 years 10 months ago
A constructive algorithm for realizing a distance matrix
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Sacha C. Varone
IANDC
2007
117views more  IANDC 2007»
13 years 10 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
ICIP
2000
IEEE
15 years 6 days ago
Efficiently Estimating Projective Transformations
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
Richard J. Radke, Peter J. Ramadge, Tomio Echigo, ...