Sciweavers

333 search results - page 41 / 67
» A Unifying Framework for the Analysis of a Class of Euclidea...
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
POPL
2007
ACM
14 years 8 months ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta
SCL
2011
12 years 10 months ago
Regularity issues for the null-controllability of the linear 1-d heat equation
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
Sorin Micu, Enrique Zuazua
ACTA
2000
92views more  ACTA 2000»
13 years 7 months ago
How to Calculate Symmetries of Petri Nets
Symmetric net structure yields symmetric net behaviour. Thus, knowing the symmetries of a net, redundant calculations can be skipped. We present a framework for the calculation of ...
Karsten Schmidt 0004
STACS
1999
Springer
13 years 12 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann