Sciweavers

513 search results - page 91 / 103
» Finitely Based, Finite Sets of Words
Sort
View
NHM
2010
100views more  NHM 2010»
13 years 2 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
13 years 11 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
ICML
2010
IEEE
13 years 8 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
CAD
2007
Springer
13 years 7 months ago
Boundary of the volume swept by a free-form solid in screw motion
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
Jarek Rossignac, J. J. Kim, S. C. Song, K. C. Suh,...