Sciweavers

7840 search results - page 171 / 1568
» On generalized Ramsey numbers
Sort
View
DCC
2003
IEEE
16 years 10 days 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
122
Voted
FOSSACS
2010
Springer
15 years 7 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 ...
76
Voted
ICCS
2004
Springer
15 years 6 months ago
A Fast Multifrontal Solver for Non-linear Multi-physics Problems
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
Alberto Bertoldo, Mauro Bianco, Geppino Pucci
89
Voted
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 6 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan
COMPGEOM
2010
ACM
15 years 5 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg