Sciweavers

2 search results - page 1 / 1
» Deterministic Length Reduction: Fast Convolution in Sparse D...
Sort
View
54
Voted
CPM
2007
Springer
167views Combinatorics» more  CPM 2007»
15 years 3 months ago
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...
Amihood Amir, Oren Kapah, Ely Porat
ECML
2005
Springer
15 years 3 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand