Sciweavers

1787 search results - page 123 / 358
» Approximation Techniques for Spatial Data
Sort
View
JMLR
2011
167views more  JMLR 2011»
14 years 11 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 8 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 10 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
132
Voted
ISCAS
1999
IEEE
97views Hardware» more  ISCAS 1999»
15 years 9 months ago
Monaural separation of independent acoustical components
The problem of blindly separating signal mixtures with fewer mixture components than independent signal sources is mathematically ill-defined, and requires suitable prior informat...
Gert Cauwenberghs
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
16 years 4 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...