Sciweavers

3874 search results - page 515 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
16 years 5 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
ICPR
2010
IEEE
15 years 11 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
IDA
2009
Springer
15 years 11 months ago
Bayesian Non-negative Matrix Factorization
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
Mikkel N. Schmidt, Ole Winther, Lars Kai Hansen
125
Voted
ICASSP
2008
IEEE
15 years 11 months ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 11 months ago
Maximizing Throughput in Layered Peer-to-Peer Streaming
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
Liang Dai, Yi Cui, Yuan Xue