Sciweavers

250 search results - page 7 / 50
» A metric cache for similarity search
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
WSDM
2010
ACM
261views Data Mining» more  WSDM 2010»
15 years 6 months ago
Learning Similarity Metrics for Event Identification in Social Media
Social media sites (e.g., Flickr, YouTube, and Facebook) are a popular distribution outlet for users looking to share their experiences and interests on the Web. These sites host ...
Hila Becker, Mor Naaman, Luis Gravano
CIKM
2008
Springer
14 years 11 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
WWW
2005
ACM
15 years 10 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
DATESO
2010
169views Database» more  DATESO 2010»
14 years 7 months ago
Parametrised Hausdorff Distance as a Non-Metric Similarity Model for Tandem Mass Spectrometry
Abstract. Tandem mass spectrometry is a widely used method for protein and peptide sequences identification. Since the mass spectra contain up to 80% of noise and many other inaccu...
Jiri Novák, David Hoksza