Sciweavers

4886 search results - page 561 / 978
» Approximate Data Exchange
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 3 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
SDM
2012
SIAM
237views Data Mining» more  SDM 2012»
13 years 9 months ago
A Distributed Kernel Summation Framework for General-Dimension Machine Learning
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
Dongryeol Lee, Richard W. Vuduc, Alexander G. Gray
204
Voted
WIDM
2006
ACM
16 years 24 days ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
VIS
2008
IEEE
128views Visualization» more  VIS 2008»
16 years 8 months ago
Box Spline Reconstruction On The Face-Centered Cubic Lattice
We introduce and analyze an efficient reconstruction algorithm for FCC-sampled data. The reconstruction is based on the 6-direction box spline that is naturally associated with the...
Minho Kim, Alireza Entezari, Jörg Peters