Sciweavers

320 search results - page 28 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
JMLR
2002
117views more  JMLR 2002»
13 years 8 months ago
Learning to Construct Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
CIVR
2007
Springer
119views Image Analysis» more  CIVR 2007»
14 years 2 months ago
An in-memory relevance feedback technique for high-performance image retrieval systems
Content-based image retrieval with relevant feedback has been widely adopted as the query model of choice for improved effectiveness in image retrieval. The effectiveness of thi...
Ning Yu, Khanh Vu, Kien A. Hua
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
12 years 11 months ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...
VLDB
2001
ACM
92views Database» more  VLDB 2001»
14 years 28 days ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
PR
2006
132views more  PR 2006»
13 years 8 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...