137 search results - page 18 / 28 » Ordinal Embedding: Approximation Algorithms and Dimensionali... |
123
click to vote
DASFAA
2008
IEEE
15 years 10 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
135
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
339
Voted
ICDAR
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
121
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...