Sciweavers

1213 search results - page 186 / 243
» Approximation in quantale-enriched categories
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2009
ACM
120views Database» more  SIGMOD 2009»
15 years 10 months ago
Kernel-based skyline cardinality estimation
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
Zhenjie Zhang, Yin Yang, Ruichu Cai, Dimitris Papa...
SIGMOD
2009
ACM
184views Database» more  SIGMOD 2009»
15 years 10 months ago
Minimizing the communication cost for continuous skyline maintenance
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
Zhenjie Zhang, Reynold Cheng, Dimitris Papadias, A...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
15 years 10 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden