166 search results - page 10 / 34 » Spiders as Robust Point Descriptors |
103
click to vote
SGP
2007
14 years 12 months ago
2007
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...
SGP
2004
14 years 12 months ago
2004
: 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...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
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...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
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...
SMI
2006
IEEE
15 years 3 months ago
2006
IEEE
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...