Sciweavers

1813 search results - page 181 / 363
» Calculi of Approximation Spaces
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 6 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
COCOON
2005
Springer
16 years 22 hour ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
WWW
2011
ACM
15 years 1 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 6 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa