Sciweavers

1199 search results - page 208 / 240
» Parameterized Proof Complexity
Sort
View
CAV
2001
Springer
154views Hardware» more  CAV 2001»
13 years 11 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
FOSAD
2000
Springer
13 years 11 months ago
Security Goals: Packet Trajectories and Strand Spaces
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
Joshua D. Guttman
ECCV
2010
Springer
13 years 11 months ago
Exploring Ambiguities for Monocular Non-Rigid Shape Estimation
Recovering the 3D shape of deformable surfaces from single images is difficult because many different shapes have very similar projections. This is commonly addressed by restricti...
PODC
2010
ACM
13 years 9 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...
FORMATS
2008
Springer
13 years 9 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...