Sciweavers

12519 search results - page 353 / 2504
» Approximation Problems Categories
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
Chao Tian, Soheil Mohajer, Suhas N. Diggavi
MCS
2008
Springer
15 years 6 months ago
Approximation of matrix operators applied to multiple vectors
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
Marlis Hochbruck, Jörg Niehoff
IJFCS
2002
58views more  IJFCS 2002»
15 years 6 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ICC
2009
IEEE
140views Communications» more  ICC 2009»
15 years 4 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...