Sciweavers

1397 search results - page 38 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
GIS
2006
ACM
14 years 9 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
SIGMOD
1999
ACM
143views Database» more  SIGMOD 1999»
14 years 24 days ago
WALRUS: A Similarity Retrieval Algorithm for Image Databases
Traditional approaches for content-based image querying typically compute a single signature for each image based on color histograms, texture, wavelet transforms etc., and return...
Apostol Natsev, Rajeev Rastogi, Kyuseok Shim
CN
2010
183views more  CN 2010»
13 years 8 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi
EMMCVPR
2001
Springer
14 years 1 months ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps
CVPR
2011
IEEE
13 years 7 days ago
A Novel Parametrization of the Perspective-Three-Point Problem for a Direct Computation of Absolute Camera Position and Orientat
The Perspective-Three-Point (P3P) problem aims at determining the position and orientation of the camera in the world reference frame from three 2D-3D point correspondences. This ...
Laurent Kneip, Davide Scaramuzza, Roland Siegwart