Sciweavers

736 search results - page 134 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
ADHOC
2010
163views more  ADHOC 2010»
13 years 8 months ago
A probabilistic method for cooperative hierarchical aggregation of data in VANETs
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
Christian Lochert, Björn Scheuermann, Martin ...
CGF
2010
146views more  CGF 2010»
13 years 8 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 8 months ago
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
Pascal Koiran, Sylvain Perifel