1261 search results - page 102 / 253 » Approximation algorithms for aligning points |
SIAMSC
2008
14 years 9 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
168
click to vote
GIS
2004
ACM
15 years 11 months ago
2004
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock,...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We present a completely automatic method for obtaining the approximate calibration of a camera (alignment to a world frame and focal length) from a single image of an unknown scene...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...