Sciweavers

71 search results - page 3 / 15
» Embedding a set of rational points in lower dimensions
Sort
View
MLDM
2005
Springer
13 years 11 months ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz

Publication
417views
14 years 2 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
CSSE
2008
IEEE
13 years 7 months ago
A Power-Efficient Floating-Point Co-processor Design
According to dramatically growing interesting in power-efficient embedded processor, designers must establish the proper power strategy when they design new embedded processor core...
Xunying Zhang, Xubang Shen
COMPGEOM
1994
ACM
13 years 9 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
14 years 10 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr