Sciweavers

2642 search results - page 504 / 529
» The development of Chez Scheme
Sort
View
133
Voted
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 27 days ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 21 days ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
16 years 19 days ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 19 days ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
109
Voted
ICFP
2005
ACM
16 years 13 days ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...