Sciweavers

727 search results - page 119 / 146
» Private approximation of search problems
Sort
View
EDBT
2009
ACM
134views Database» more  EDBT 2009»
14 years 1 months ago
Caching content-based queries for robust and efficient image retrieval
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
13 years 21 days 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...
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
14 years 3 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 10 months ago
Ensemble-index: a new approach to indexing large databases
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 ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
GECCO
2003
Springer
14 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell