274 search results - page 43 / 55 » Program Compression |
87
Voted
CAD
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
95
Voted
CISS
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...
107
Voted
JMLR
2012
12 years 12 months ago
2012
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
119
click to vote
SIAMREV
2010
14 years 4 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...