Sciweavers

4198 search results - page 278 / 840
» In search of lost time
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 8 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
WWW
2009
ACM
16 years 7 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
CHI
2008
ACM
16 years 7 months ago
Interlaced QWERTY: accommodating ease of visual search and input flexibility in shape writing
Shape writing is an input technology for touch-screen mobile phones and pen-tablets. To shape write text, the user spells out word patterns by sliding a finger or stylus over a gr...
Shumin Zhai, Per Ola Kristensson
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...