Sciweavers

166 search results - page 10 / 34
» Spiders as Robust Point Descriptors
Sort
View
SGP
2007
13 years 10 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...
SGP
2004
13 years 10 months ago
Spectral Surface Reconstruction From Noisy Point Clouds
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Differential privacy and robust statistics
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
Cynthia Dwork, Jing Lei
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
14 years 1 months ago
A study of evolutionary robustness in stochastically tiled polyominos
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...
Justin Schonfeld, Daniel A. Ashlock
SMI
2006
IEEE
131views Image Analysis» more  SMI 2006»
14 years 1 months ago
Robust 3D Shape Correspondence in the Spectral Domain
We present an algorithm for finding a meaningful vertexto-vertex correspondence between two 3D shapes given as triangle meshes. Our algorithm operates on embeddings of the two sh...
Varun Jain, Hao Zhang 0002