285 search results - page 37 / 57 » Approximate Nearest Neighbor Searching in Multimedia Databas... |
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
The massive amount of near-duplicate and duplicate web videos has presented both challenge and opportunity to multimedia computing. On one hand, browsing videos on Internet become...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
JMLR
2010
13 years 2 months 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 ...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...