Sciweavers

182 search results - page 22 / 37
» Structured semidefinite representation of some convex sets
Sort
View
93
Voted
CAV
1993
Springer
127views Hardware» more  CAV 1993»
15 years 3 months ago
Symbolic Equivalence Checking
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun...
CSL
2010
Springer
15 years 23 days ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
MP
2008
135views more  MP 2008»
14 years 11 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
CSDA
2006
109views more  CSDA 2006»
14 years 11 months ago
Possibility theory and statistical reasoning
Numerical possibility distributions can encode special convex families of probability measures. The connection between possibility theory and probability theory is potentially fru...
Didier Dubois
ICASSP
2010
IEEE
14 years 12 months ago
Kronecker product matrices for compressive sensing
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
Marco F. Duarte, Richard G. Baraniuk