Sciweavers

631 search results - page 21 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
ICML
2003
IEEE
14 years 11 months ago
Weighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Nathan Srebro, Tommi Jaakkola
DISOPT
2008
118views more  DISOPT 2008»
13 years 10 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
IEICET
2008
95views more  IEICET 2008»
13 years 10 months ago
Approximating the Best Linear Unbiased Estimator of Non-Gaussian Signals with Gaussian Noise
Obtaining the best linear unbiased estimator (BLUE) of noisy signals is a traditional but powerful approach to noise reduction. Explicitly computing the BLUE usually requires the ...
Masashi Sugiyama, Motoaki Kawanabe, Gilles Blancha...
TIT
2011
116views more  TIT 2011»
13 years 5 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 3 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee