Filters








9,749 Hits in 4.4 sec

Dual local consistency hashing with discriminative projections selection

Peng Li, Jian Cheng, Hanqing Lu
2013 Signal Processing  
Semantic hashing is a promising way to accelerate similarity search, which designs compact binary codes for a large number of images so that semantically similar images are mapped to close codes.  ...  Therefore, the binary codes learned by our approach are more powerful and discriminative for similarity search.  ...  In order to efficiently exploit such enormous web contents, fast search in large scale has become one of the most critical techniques.  ... 
doi:10.1016/j.sigpro.2012.05.035 fatcat:nor3zecct5hoheeorqkxhih6d4

Hashing with dual complementary projection learning for fast image retrieval

Peng Li, Jian Cheng, Hanqing Lu
2013 Neurocomputing  
Due to explosive growth of visual content on the web, there is an emerging need of fast similarity search to efficiently exploit such enormous web contents from very large databases.  ...  Recently, hashing has become very popular for efficient nearest neighbor search in large scale applications.  ...  The CIFAR-10 dataset [26] is a subset of the Tiny Images dataset and it consists of 60 000 color images in 10 classes, with 6000 images per class.  ... 
doi:10.1016/j.neucom.2012.07.053 fatcat:ko5utzwug5hk3jheok5vzy6l6a

Efficient data cleaning algorithm using decision tree classification model approach and modified new unique user identification algorithm using hashing techniques with a new error factor

Ranjena Sriram, S Sheeja, I Henry Alexander
2018 International Journal of Engineering & Technology  
The modified hashing function along with binary search techniques is used to design the new unique user identification algorithm.  ...  Apart from this the study has also modified the previously proposed hash function, used to locate existing web users in web log server.  ...  The new hashing function has consumed 8.26 seconds for Nehru Arts and Science College web log data, 8.36 seconds for Murdoch University Web log data and 8.58 seconds for ECMIT web log data to search and  ... 
doi:10.14419/ijet.v7i1.9.9736 fatcat:ozl2oav6mbf5lluao7x4b2l5mu

Pocket cloudlets

Emmanouil Koukoumidis, Dimitrios Lymberopoulos, Karin Strauss, Jie Liu, Doug Burger
2011 Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11  
We show that Pock-etSearch can serve, on average, 66% of the web search queries submitted by an individual user without having to use the slow 3G link, leading to 16x service access speedup.  ...  Non-volatile memories (NVM), however, may continue experiencing significant and steady improvements in density for at least ten more years.  ...  It consists of two components, a hash table and a custom database of search results. The hash table lives in main memory and its role is to link queries to search results.  ... 
doi:10.1145/1950365.1950387 dblp:conf/asplos/KoukoumidisLSLB11 fatcat:wyuknzqcvfhbzg62ezyv4gzuqa

Pocket cloudlets

Emmanouil Koukoumidis, Dimitrios Lymberopoulos, Karin Strauss, Jie Liu, Doug Burger
2012 SIGPLAN notices  
We show that Pock-etSearch can serve, on average, 66% of the web search queries submitted by an individual user without having to use the slow 3G link, leading to 16x service access speedup.  ...  Non-volatile memories (NVM), however, may continue experiencing significant and steady improvements in density for at least ten more years.  ...  It consists of two components, a hash table and a custom database of search results. The hash table lives in main memory and its role is to link queries to search results.  ... 
doi:10.1145/2248487.1950387 fatcat:7k3cuanjpfakdjhllepq2h26ci

Pocket cloudlets

Emmanouil Koukoumidis, Dimitrios Lymberopoulos, Karin Strauss, Jie Liu, Doug Burger
2011 SIGPLAN notices  
We show that Pock-etSearch can serve, on average, 66% of the web search queries submitted by an individual user without having to use the slow 3G link, leading to 16x service access speedup.  ...  Non-volatile memories (NVM), however, may continue experiencing significant and steady improvements in density for at least ten more years.  ...  It consists of two components, a hash table and a custom database of search results. The hash table lives in main memory and its role is to link queries to search results.  ... 
doi:10.1145/1961296.1950387 fatcat:6wjhpuvz2rcmlnptgndyeot2lu

Pocket cloudlets

Emmanouil Koukoumidis, Dimitrios Lymberopoulos, Karin Strauss, Jie Liu, Doug Burger
2011 SIGARCH Computer Architecture News  
We show that Pock-etSearch can serve, on average, 66% of the web search queries submitted by an individual user without having to use the slow 3G link, leading to 16x service access speedup.  ...  Non-volatile memories (NVM), however, may continue experiencing significant and steady improvements in density for at least ten more years.  ...  It consists of two components, a hash table and a custom database of search results. The hash table lives in main memory and its role is to link queries to search results.  ... 
doi:10.1145/1961295.1950387 fatcat:crhijbomkvdzhlam5l2vsyvo54

Sketches image analysis: Web image search engine usingLSH index and DNN InceptionV3 [article]

Alessio Schiavo, Filippo Minutella, Mattia Daole, Marsha Gomez Gomez
2021 arXiv   pre-print
In this study we implement a web image search engine on top of a Locality Sensitive Hashing(LSH) Index to allow fast similarity search on deep features.  ...  The adoption of an appropriate approximate similarity search method is an essential prereq-uisite for developing a fast and efficient CBIR system, especially when dealing with large amount ofdata.  ...  Giuseppe Amato, Claudio Gennaro and Fabrizio Falchi) for the Master Degree in "Artificial Intelligence and Data Engineering" of the University of Pisa.  ... 
arXiv:2105.01147v1 fatcat:h4r4l4f56ba7hfz6qglss3gwd4

Verifying Search Results Over Web Collections [article]

Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes
2012 arXiv   pre-print
As we experimentally demonstrate, the prototype implementation of our system gives a low communication overhead between the search engine and the user, and allows for fast verification of the returned  ...  In our solution, along with the web pages that satisfy any given search query, the search engine also returns a cryptographic proof.  ...  We thank Isabel Cruz, Kristin Lauter, James Lentini, and Michael Naehrig for useful discussions.  ... 
arXiv:1204.5446v2 fatcat:5osligxudfagxlsnst6uze64iu

Efficient verification of web-content searching through authenticated web crawlers

Michael T. Goodrich, Charalampos Papamanthou, Duy Nguyen, Roberto Tamassia, Cristina Videira Lopes, Olga Ohrimenko, Nikos Triandopoulos
2012 Proceedings of the VLDB Endowment  
complete; (ii) the verification of the content returned by such Internet queries-this guarantees that web data is authentic and has not been maliciously altered since the computation of the signature by  ...  As we experimentally demonstrate, the prototype implementation of our system provides a low communication overhead between the search engine and the user, and fast verification of the returned results  ...  We thank Isabel Cruz, Kristin Lauter, James Lentini, and Michael Naehrig for useful discussions.  ... 
doi:10.14778/2336664.2336666 fatcat:xqss7qox75c3fgmvez4wfxwv2u

In-memory hash tables for accumulating text vocabularies

Justin Zobel, Steffen Heinz, Hugh E. Williams
2001 Information Processing Letters  
For small-to-medium size hash tables, move-to-front bit-wise hashing is almost twice as fast as bit-wise hashing.  ...  B-trees are not ideally suited for searching of skew data.  ... 
doi:10.1016/s0020-0190(01)00239-3 fatcat:e5d332xv2nd3towoabbeeynd4u

The Hong Kong/AAO/Strasbourg Hα (HASH) Planetary Nebula Database

Ivan S. Bojičić, Quentin A. Parker, David J. Frew
2016 Proceedings of the International Astronomical Union  
a repository of observational data (imaging and spectroscopy) for these and related astronomical objects.  ...  The main motivation for creating this system is resolving some of long standing problems in the field e.g. problems with mimics and dubious and/or misidentifications, errors in observational data and consolidation  ...  The backbone of HASH is the relational database (MySQL) which provides data consistency and quick, efficient search and manipulation.  ... 
doi:10.1017/s1743921317003234 fatcat:geie525btngrhja4kv5wqqc7zm

Spectral Hashing With Semantically Consistent Graph for Image Indexing

Peng Li, Meng Wang, Jian Cheng, Changsheng Xu, Hanqing Lu
2013 IEEE transactions on multimedia  
The ability of fast similarity search in a large-scale dataset is of great importance to many multimedia applications.  ...  Semantic hashing is a promising way to accelerate similarity search, which designs compact binary codes for a large number of images so that semantically similar images are mapped to close codes.  ...  For the NUS-WIDE dataset, we conduct the image auto-tagging experiments based on the hashing-based fast similarity search methods.  ... 
doi:10.1109/tmm.2012.2199970 fatcat:eyqkocabgvfejcmihr6ywadcum

Survey Paper on Generating Correlation among Different Modalities by Using Parallel Processing for Cross-Media Retrieval

Rokkam SrikanthReddy
2017 International Journal for Research in Applied Science and Engineering Technology  
Hashing methods are useful for performing variety of tasks in recent years. Various hashing approaches have been performing retrieve the cross-media information.  ...  Search can be based on text or other content-based information. It have a problem to process different modalities in a single process.  ...  Angular Quantization-based Binary Codes for Fast Similarity Search Y. Gong, S. Kumar, V. Verma, and S.  ... 
doi:10.22214/ijraset.2017.8309 fatcat:5j65haeztfdedoljvqrczo2pxq

Web acquired image datasets need curation: an examplar pipeline evaluated on Greek food images

Vasileios Sevetlidis, George Pavlidis, Vasileios Arampatzakis, Chairi Kiourt, Spyridon Mouroutsos, Antonios Gasteratos
2021 Zenodo  
This paper suggests a pipeline consisting of state-of- the-art and off-the-shelf methods for curating an image dataset retrieved from the Web.  ...  Mining Web data to create AI-usable datasets, is still non-trivial.  ...  We also gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for the experiments of this research.  ... 
doi:10.5281/zenodo.5553704 fatcat:lnulaikjorai5nb65txpkl3qea
« Previous Showing results 1 — 15 out of 9,749 results