1802 search results - page 108 / 361 » Complexity Theory for Operators in Analysis |
133
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancella...
149
click to vote
DOCENG
2009
ACM
16 years 26 days ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
182
click to vote
SRDS
1999
IEEE
15 years 10 months ago
1999
IEEE
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
279
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
152
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...