Sciweavers

1313 search results - page 251 / 263
» Data Discretization Unification
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 7 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
DCC
2007
IEEE
14 years 7 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 5 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 5 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
ALT
2008
Springer
14 years 4 months ago
Nonparametric Independence Tests: Space Partitioning and Kernel Approaches
Abstract. Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-...
Arthur Gretton, László Györfi