20 search results - page 1 / 4 » Approximating the distance to monotonicity in high dimension... |
TALG
2010
13 years 9 months ago
2010
SISAP
2008
IEEE
14 years 5 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
SODA
2008
ACM
14 years 9 days ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
VLDB
1999
ACM
14 years 3 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
CVPR
2007
IEEE
15 years 27 days ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...