Results 241 to 250 of about 1,243,483 (265)

Similarity Pruning in PrOM Search

2006
In this paper we introduce a new pruning mechanism, called Similarity Pruning for Probabilistic Opponent-Model (PrOM) Search. It is based on imposing a bound on the differences between two or more evaluation functions. Assuming such a bound exists, we are able to prove two theoretical properties, viz., the bound-conservation property and the bounded ...
Donkers, H.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M.   +2 more
openaire   +1 more source

Rank hash similarity for fast similarity search

Information Processing & Management, 2013
The paper is concerned with similarity search at large scale, which efficiently and effectively finds similar data points for a query data point. An efficient way to accelerate similarity search is to learn hash functions. The existing approaches for learning hash functions aim to obtain low values of Hamming distances for the similar pairs.
Min Lu, YaLou Huang, MaoQiang Xie, Jie Liu   +3 more
openaire   +1 more source

User-Centric Similarity Search

IEEE Transactions on Knowledge and Data Engineering, 2017
User preferences play a significant role in market analysis. In the database literature, there has been extensive work on query primitives, such as the well known top- $k$ query that can be used for the ranking of products based on the preferences customers have expressed.
Konstantinos Georgoulas, Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis   +3 more
openaire   +1 more source

Efficient similarity search

2017
This chapter addresses one of the fundamental problems involved in multimedia systems, namely efficient similarity search for large collections of multimedia content. This problem has received a lot of attention from various research communities. In particular, it is a historical line of research in computational geometry and databases.
openaire   +1 more source

Computation of Similarity—Similarity Search as Computation

2011
We present a number of applications in Natural Language Processing where the main computation consists of a similarity search for an input pattern in a large database. Afterwards we describe some efficient methods and algorithms for solving this computational challenge.
Stoyan Mihov, Klaus U. Schulz
openaire   +1 more source

Trademark Image Similarity Search

2018
A trademark may be a word, phrase, symbol, sound, color, scent or design, or a combination of these, that identifies and distinguishes the products or services of a particular source from those of others. One of the crucial steps both prior to filing of the trademark applications as well as during the review of these applications is conducting a ...
Girish Showkatramani, Sashi Nareddi, Chris Doninger, Greg Gabel, Arthi Krishna   +4 more
openaire   +1 more source

Caching algorithms for similarity search

2009
Similarity search in metric spaces is a general paradigm that can be used in several application fields. One of them is content-based image retrieval systems. In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must be efficient and scalable.
Lucchese C, Falchi F, Perego R, Rabitti F, Orlando S   +4 more
openaire   +3 more sources

Similarity Search and Applications

2015
This book constitutes the proceedings of the 8th International Conference on Similarity Search and Applications, SISAP 2015, held in Glasgow, UK, in October 2015. The 19 full papers, 12 short and 9 demo and poster papers presented in this volume were carefully reviewed and selected from 68 submissions.
openaire   +2 more sources

Similarity Search

2008
Shashi Shekhar, Hui Xiong
openaire   +1 more source

Secure Similarity Search

2007 IEEE International Conference on Granular Computing (GRC 2007), 2007
Hyun-A Park, Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, Justin Zhan   +4 more
openaire   +1 more source