Sciweavers

250 search results - page 1 / 50
» A metric cache for similarity search
Sort
View
CIKM
2008
Springer
13 years 6 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
EDBT
2009
ACM
134views Database» more  EDBT 2009»
13 years 8 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...
INFOSCALE
2007
ACM
13 years 6 months ago
Evaluation study of a distributed caching based on query similarity in a P2P network
Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnec...
Mouna Kacimi, Kokou Yétongnon
DATESO
2004
81views Database» more  DATESO 2004»
13 years 6 months ago
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
Tomás Skopal
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
13 years 10 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula