Sciweavers

1746 search results - page 248 / 350
» A linear implementation of PACMAN
Sort
View
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
16 years 3 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
DCC
2004
IEEE
16 years 3 months ago
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
Anna H. Lee, Michelle Effros, Muriel Médard...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 1 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Motion Blur for EWA Surface Splatting
This paper presents a novel framework for elliptical weighted average (EWA) surface splatting with time-varying scenes. We extend the theoretical basis of the original framework b...
Simon Heinzle, Johanna Wolf, Yoshihiro Kanamori, T...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
16 years 1 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh