Sciweavers

2569 search results - page 471 / 514
» Approximate Objects and Approximate Theories
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 days 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»
16 years 1 days 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»
16 years 1 days 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...
ICFP
2007
ACM
15 years 11 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
MOBIHOC
2008
ACM
15 years 11 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan