Sciweavers

121 search results - page 20 / 25
» Codegree problems for projective geometries
Sort
View
GRC
2008
IEEE
13 years 8 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
GIS
2005
ACM
14 years 8 months ago
Supporting uncertainty in moving objects in network databases
The management of moving objects has been intensively studied in the recent years. A wide and increasing range of database applications has to deal with spatial objects whose posi...
Ralf Hartmut Güting, Victor Teixeira de Almei...
SIBGRAPI
2008
IEEE
14 years 1 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ICCV
2001
IEEE
14 years 9 months ago
Beyond Lambert: Reconstructing Surfaces with Arbitrary BRDFs
W e address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance...
Sebastian Magda, David J. Kriegman, Todd Zickler, ...