Sciweavers

535 search results - page 37 / 107
» Checking Computations in Polylogarithmic Time
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
SPIN
2009
Springer
14 years 3 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...
IPL
2007
125views more  IPL 2007»
13 years 8 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
PODC
2009
ACM
14 years 9 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
RTSS
2009
IEEE
14 years 3 months ago
Distributed, Modular HTL
Abstract—The Hierarchical Timing Language (HTL) is a realtime coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedo...
Thomas A. Henzinger, Christoph M. Kirsch, Eduardo ...