Sciweavers

3096 search results - page 155 / 620
» The Generalized FITC Approximation
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 9 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
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 9 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
LMCS
2006
98views more  LMCS 2006»
13 years 9 months ago
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
IJBC
2007
80views more  IJBC 2007»
13 years 9 months ago
Exact Approximations of omega Numbers
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
Cristian S. Calude, Michael J. Dinneen
TWC
2008
109views more  TWC 2008»
13 years 8 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad Hoc Networks
Abstract-- This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets success...
Atef Abdrabou, Weihua Zhuang