Filters








15,584 Hits in 4.6 sec

A Scalable Nearest Neighbor Search in P2P Systems [chapter]

Michal Batko, Claudio Gennaro, Pavel Zezula
2005 Lecture Notes in Computer Science  
Similarity search in metric spaces represents an important paradigm for content-based retrieval of many applications.  ...  In this article, we study the problem of executing the nearest neighbor(s) queries in a distributed metric structure, which is based on the P2P communication paradigm and the generalized hyperplane partitioning  ...  Section 4 describes the strategies for the nearest neighbor search, which are experimentally evaluated in Section 5. The paper concludes in Section 6.  ... 
doi:10.1007/978-3-540-31838-5_6 fatcat:r4icytuur5hqnhb33twbr66tpu

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

Ishak
2009 Journal of Computer Science  
We exploited the nearest-neighbor concept on our query similarity and query hits space metrics for selecting the most relevant peers for efficient searching.  ...  Approach: This study addressed the need for efficient flood-based searching in unstructured peer-to-peer network by considering the content of query and only selecting peers that were most related to the  ...  the normal search radius Fig. 5 Nearest-neighbor search space Fig. 7 : 7 Messages used for 50 queries searching Fig. 13 : 13 Messages used for 100 queries searching we can show in Fig. 14: Search  ... 
doi:10.3844/jcssp.2009.184.190 fatcat:arjmdcrdxbcdvllcmt44wnf5ve

Selective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks

Iskandar Ishak, Naomie Salim
2009 Journal of Computer Science  
We exploited the nearest-neighbor concept on our query similarity and query hits space metrics for selecting the most relevant peers for efficient searching.  ...  Approach: This study addressed the need for efficient flood-based searching in unstructured peer-to-peer network by considering the content of query and only selecting peers that were most related to the  ...  the normal search radius Fig. 5 Nearest-neighbor search space Fig. 7 : 7 Messages used for 50 queries searching Fig. 13 : 13 Messages used for 100 queries searching we can show in Fig. 14: Search  ... 
doi:10.3844/jcs.2009.184.190 fatcat:i3vkf3m3dbb3jm5ty5yllzozii

Multimedia search and retrieval using multimodal annotation propagation and indexing techniques

Michalis Lazaridis, Apostolos Axenopoulos, Dimitrios Rafailidis, Petros Daras
2013 Signal processing. Image communication  
In this paper, a novel framework for multimodal search and retrieval of rich media objects is presented.  ...  space, where all media objects can be mapped irrespective of their constituting modalities.  ...  Acknowledgment This work was supported by the EC-funded projects I-SEARCH and ASSETS: http://www.isearch-project.eu/isearch/ http://www.assets4europeana.eu/  ... 
doi:10.1016/j.image.2012.04.001 fatcat:h6eto4v6nnazdj6e5yvveqcmom

Metric-Based Similarity Search in Unstructured Peer-to-Peer Systems [chapter]

Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis
2012 Lecture Notes in Computer Science  
We propose the construction of metric routing indices suitable for distributed similarity search in metric spaces.  ...  Efficient search over widely distributed multimedia content requires techniques for distributed retrieval based on generic metric distance functions.  ...  Conclusions Similarity search in metric spaces has several applications, such as image retrieval.  ... 
doi:10.1007/978-3-642-28148-8_2 fatcat:m3ni4vmstfdptbfn47xblgkk2a

Know Thy Neighbor: Combining audio features and social tags for effective music similarity

Alexandros Nanopoulos, Ioannis Karydis
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
In this paper, we address this problem by proposing a combination of the audio and the tag feature space of musical data.  ...  Measuring similarity of two musical pieces is an ill-defined problem for which recent research on contextual information, assigned as free-form text (tags) in social networking services, has shown to be  ...  From these k 1 neighbors, we select the single one with the highest weight. Next, KTN searches in the tag feature space in order to find the k nearest neighbors of the selected track.  ... 
doi:10.1109/icassp.2011.5946366 dblp:conf/icassp/NanopoulosK11 fatcat:scfo4y3h75hfvfbbdgcsebm5ki

HybridNN: Supporting Network Location Service on Generalized Delay Metrics [article]

Yongquan Fu, Yijie Wang, Ernst Biersack
2011 arXiv   pre-print
Distributed Nearest Neighbor Search (DNNS) locates service nodes that have shortest interactive delay towards requesting hosts.  ...  Simulation results show that HybridNN locates nearly optimally the nearest neighbor.  ...  Here we will just give two examples namely, K closest neighbor search and K farthest neighbor search, which are both utilized to oversample neighbors in the network delay space in order to increase the  ... 
arXiv:1108.1928v1 fatcat:6mes6suavverppqnqlkldqdvoy

OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain

Huakun Liu, Xin Wei, Ruliang Xiao, Lifei Chen, Xin Du, Shi Zhang
2018 EURASIP Journal on Wireless Communications and Networking  
Secondly, the approximate nearest neighbor search strategy was used in place of the nearest neighbor strategy, to reduce querying time.  ...  It is an effective solution to the binary hybrid search of approximate neighbors, and it is applicable to the WMSN data search based on smart contracts in WMSN blockchain systems.  ...  So, we must borrow the InterPlanetary File System (IPFS) because it provides us a high-throughput content-addressable block storage model with content-addressable hyperlinks [15] , which forms a generic  ... 
doi:10.1186/s13638-018-1221-3 fatcat:6ub2uw7igbah3mucwdi2jbgox4

Toward personalized peer-to-peer top-k processing

Xiao Bai, Marin Bertier, Rachid Guerraoui, Anne-Marie Kermarrec
2009 Proceedings of the Second ACM EuroSys Workshop on Social Network Systems - SNS '09  
We present the first personalized peer-to-peer top-k search protocol for a collaborative tagging system.  ...  Each peer maintains relevant personalized information about its tagging behavior as well as that of its social neighbors, and uses those to locally process its queries.  ...  Personal Network Construction In our scheme, the personal network is discovered and maintained through a two-layer gossip protocol.  ... 
doi:10.1145/1578002.1578003 dblp:conf/sns/BaiBGK09 fatcat:qobnegn6a5hmhfz3xorhrjcgwu

Application-Driven Near-Data Processing for Similarity Search [article]

Vincent T. Lee, Amrita Mazumdar, Carlo C. del Mundo, Armin Alaghi, Luis Ceze, Mark Oskin
2017 arXiv   pre-print
At its core, similarity search manifests as k-nearest neighbors (kNN), a computationally simple primitive consisting of highly parallel distance calculations and a global top-k sort.  ...  Finally, we show that SSAM is also useful for other data intensive tasks like kNN index construction, and can be generalized to semantically function as a high capacity content addressable memory.  ...  Once a query is generated, the k-nearest neighbors stage (Figure 1d ) attempts to search for the most similar content in the database.  ... 
arXiv:1606.03742v2 fatcat:tgyyr4avubbzjmr7pz7obiqmle

A Graph Diffusion Scheme for Decentralized Content Search based on Personalized PageRank

Nikolaos Giatsoglou, Emmanouil Krasanakis, Symeon Papadopoulos, Ioannis Kompatsiaris
2022 Zenodo  
In this work, we adopt a fresh outlook for decentralized search in P2P networks that is inspired by advancements in dense information retrieval and graph signal processing.  ...  We then use the diffused representations to guide search queries towards relevant content.  ...  Ioannis Sarafis for his productive feedback on the decentralized search scheme.  ... 
doi:10.5281/zenodo.6497726 fatcat:u52ad3xmk5ez5cvxfx4bua4fa4

A Graph Diffusion Scheme for Decentralized Content Search based on Personalized PageRank [article]

Nikolaos Giatsoglou, Emmanouil Krasanakis, Symeon Papadopoulos, Ioannis Kompatsiaris
2022 arXiv   pre-print
In this work, we adopt a fresh outlook for decentralized search in P2P networks that is inspired by advancements in dense information retrieval and graph signal processing.  ...  We then use the diffused representations to guide search queries towards relevant content.  ...  Ioannis Sarafis for his productive feedback on the decentralized search scheme.  ... 
arXiv:2204.12902v1 fatcat:txgghpgh5ng4zel4d3li367lie

SWAM

Farnoush Banaei-Kashani, Cyrus Shahabi
2004 Proceedings of the Thirteenth ACM conference on Information and knowledge management - CIKM '04  
Moreover, once the query object is found, all the similar objects would be in its proximate network neighborhood and hence enabling efficient range and k-nearest-neighbor queries.  ...  of various similarity-search queries, namely exact-match, range, and knearest-neighbor queries.  ...  Acknowledgments We would like to thank Jigesh Vora, Gerran Ueyama, and Ranjit Raveendran for their assistance in conducting the experiments.  ... 
doi:10.1145/1031171.1031236 dblp:conf/cikm/Banaei-KashaniS04 fatcat:b3cw76ddpje4lh7u3sy2rom22m

ImageRover: a content-based image browser for the World Wide Web

S. Sclaroff, L. Taycher, M. La Cascia
1997 1997 Proceedings IEEE Workshop on Content-Based Access of Image and Video Libraries  
At search time, users can iteratively guide the search through the selection of relevant examples.  ...  ImageRover is a search by image content navigation tool for the world wide web.  ...  Acknowledgments This work is sponsored in part by through grants from the National Science Foundation (Faculty Early Career Award #IRI-9624168, and CISE Research Infrastructure Awards #CDA-9623865 and  ... 
doi:10.1109/ivl.1997.629714 fatcat:ctde6huoefhszfyaripjl6ivei

Deep Learning for Image Search and Retrieval in Large Remote Sensing Archives [article]

Gencer Sumbul, Jian Kang, Begüm Demir
2020 arXiv   pre-print
This chapter presents recent advances in content based image search and retrieval (CBIR) systems in remote sensing (RS) for fast and accurate information discovery from massive data archives.  ...  In particular, we present the theoretical properties of the most recent DL based CBIR systems for the characterization of the complex semantic content of RS images.  ...  To address these problems, approximate nearest neighbor (ANN) search has attracted extensive research attention in RS.  ... 
arXiv:2004.01613v2 fatcat:d4fjt3vzybbbrejxzobaluqsoq
« Previous Showing results 1 — 15 out of 15,584 results