Sciweavers

14165 search results - page 597 / 2833
» The generalized two-server problem
Sort
View
DCC
2003
IEEE
16 years 6 months ago
Design of Optimal Quantizers for Distributed Source Coding
We address the problem of designing optimal quantizers for distributed source coding. The generality of our formulation includes both the symmetric and asymmetric scenarios, toget...
David Rebollo-Monedero, Rui Zhang, Bernd Girod
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
LATA
2010
Springer
16 years 4 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
FOSSACS
2010
Springer
16 years 1 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
EDBT
2009
ACM
92views Database» more  EDBT 2009»
16 years 1 months ago
NNexus: an automatic linker for collaborative web-based corpora
—In this paper, we introduce NNexus, a generalization of the automatic linking engine of Noosphere (at PlanetMath.org) and the first system that automates the process of linking...
James J. Gardner, Aaron Krowne, Li Xiong