Sciweavers

126 search results - page 4 / 26
» Error bounds for correlation clustering
Sort
View
ICDT
2009
ACM
148views Database» more  ICDT 2009»
15 years 10 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 3 months ago
Reduced-Complexity Cluster Modelling for the 3GPP Channel Model
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
Hui Xiao, Alister G. Burr, Rodrigo C. de Lamare
SIGGRAPH
1995
ACM
15 years 1 months ago
Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination
In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method ensures that just enough work is done to meet th...
François X. Sillion, George Drettakis
CISS
2007
IEEE
15 years 3 months ago
Estimation of block-fading channels with reduced-rank correlation matrix
— In block-fading transmission, the discrete-time taps of time-varying channels can be generally modelled as a stationary random vector process with unknown and rank-deficient c...
Osvaldo Simeone, Umberto Spagnolini
DCC
2005
IEEE
14 years 11 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu