141 search results - page 17 / 29 » A Structural Induction Theorem for Processes |
MICAI
2000
Springer
13 years 11 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
CONCUR
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
TIT
2008
13 years 7 months ago
2008
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...