Sciweavers

5093 search results - page 977 / 1019
» How Real are Real Numbers
Sort
View
VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 1 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 1 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
STACS
1998
Springer
14 years 1 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John
SIGGRAPH
1996
ACM
14 years 29 days ago
Light Field Rendering
A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating be...
Marc Levoy, Pat Hanrahan
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 28 days ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek