1092 search results - page 121 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
144
Voted
SAS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
180
Voted
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
149
Voted
ASIAN
2003
Springer
15 years 11 months ago
2003
Springer
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
186
click to vote
UAI
2008
15 years 7 months ago
2008
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
168
click to vote
AAECC
2010
Springer
15 years 6 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...