Sciweavers

4277 search results - page 55 / 856
» On Multiple Linear Approximations
Sort
View
MSCS
2007
117views more  MSCS 2007»
14 years 9 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Michele Pagani
CORR
2008
Springer
96views Education» more  CORR 2008»
14 years 10 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
IFIPTCS
2010
14 years 7 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
TOG
2008
109views more  TOG 2008»
14 years 9 months ago
Geometric skinning with approximate dual quaternion blending
Skinning of skeletally deformable models is extensively used for real-time animation of characters, creatures and similar objects. The standard solution, linear blend skinning, ha...
Ladislav Kavan, Steven Collins, Jirí Z&aacu...
TIT
2011
131views more  TIT 2011»
14 years 4 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson