7351 search results - page 129 / 1471 » Segmenting Point Sets |
126
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
124
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
134
click to vote
VC
2008
15 years 4 months ago
2008
Defining sharp features in a 3D model facilitates a better understanding of the surface and aids geometric processing and graphics applications, such as reconstruction, filtering, ...
107
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
150
click to vote
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
We address the problem of automatic 3D segmentation of a stack of electron microscopy sections of brain tissue. Unlike previous efforts, where the reconstruction is usually done o...