1880 search results - page 165 / 376 » A Static Analysis for Beta-Binders |
162
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
194
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
182
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Unsupervised learning requires a grouping step that defines which data belong together. A natural way of grouping in images is the segmentation of objects or parts of objects. Whi...
178
Voted
FASE
2008
Springer
15 years 8 months ago
2008
Springer
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph...
170
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...