688 search results - page 72 / 138 » Computing with subspaces |
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
All eigel/space imerjHJfl1liull IIu!/!/Ull s/Iluulhly illler? polares between 111'0 differem eigellwaces IIsillg high dimCllsional rolatio/!. Howcl'('r, up 10 IIOW ...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Given point correspondences in multiple perspective views of a scene containing multiple rigid-body motions, we present an algorithm for segmenting the correspondences according t...
72
Voted
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Local spatiotemporal features or interest points provide compact but descriptive representations for efficient video analysis and motion recognition. Current local feature extract...
102
click to vote
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, a novel unsupervised approach for the segmentation of unorganized 3D points sets is proposed. The method derives by the mean shift clustering paradigm devoted to se...