4767 search results - page 41 / 954 » Moving between Contexts |
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...
105
click to vote
TKDE
2008
14 years 11 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a method for capturing and computing 3D parallax. 3D parallax, as used here, refers to vertical offset from the ground plane, height. The method is based on an...
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
We present a novel approach to real-time structured light range scanning. After an analysis of the underlying assumptions of existing structured light techniques, we derive a new ...