Sciweavers

3875 search results - page 548 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
IDA
2009
Springer
16 years 1 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
ICASSP
2008
IEEE
16 years 1 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»
16 years 27 days 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
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
16 years 23 days ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
SAC
2005
ACM
16 years 4 days ago
Performance evaluation for text processing of noisy inputs
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
Daniel P. Lopresti