10988 search results - page 1721 / 2198 » Algorithmic Folding Complexity |
208
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
291
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
283
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
189
Voted
VIS
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
175
Voted
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced base...