211 search results - page 3 / 43 » BoostMap: A Method for Efficient Approximate Similarity Rank... |
DEXA
2008
Springer
13 years 7 months ago
2008
Springer
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
JMLR
2010
13 years 2 days ago
2010
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
SCIA
2009
Springer
13 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...