120 search results - page 21 / 24 » On locally Delaunay geometric graphs |
CVPR
2010
IEEE
14 years 12 months ago
2010
IEEE
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
125
click to vote
MSWIM
2006
ACM
15 years 5 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
AAAI
2007
15 years 2 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
109
click to vote
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...