591 search results - page 82 / 119 » Computing fundamental groups from point clouds |
CGF
2007
14 years 10 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
108
click to vote
ICPR
2002
IEEE
16 years 2 days ago
2002
IEEE
* We present a novel approach for grouping from motion, based on a 4-D Tensor Voting computational framework. From sparse point tokens in two frames we recover the dense velocity f...
WAIM
2009
Springer
15 years 3 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
104
click to vote
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
CW
2002
IEEE
15 years 4 months ago
2002
IEEE
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...