1452 search results - page 174 / 291 » Algorithmic Analysis of Array-Accessing Programs |
111
Voted
AAECC
1999
Springer
15 years 1 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
JAR
1998
15 years 1 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
120
click to vote
SPIN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
112
click to vote
IEEEPACT
2006
IEEE
15 years 8 months ago
2006
IEEE
Static Single Assignment (SSA) has become the intermediate program representation of choice in most modern compilers because it enables efficient data flow analysis of scalars an...
158
click to vote
MM
2010
ACM
15 years 2 months ago
2010
ACM
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...