Sciweavers

220 search results - page 20 / 44
» Saturated models of universal theories
Sort
View
LICS
2006
IEEE
14 years 1 months ago
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics
d Abstract) Marcelo Fiore∗ and Sam Staton† Computer Laboratory, University of Cambridge We introduce a mathematical structural operational semantics that yields a congruence r...
Marcelo P. Fiore, Sam Staton
GRC
2007
IEEE
14 years 1 months ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang
LLC
2011
167views more  LLC 2011»
13 years 2 months ago
Computational Phonology - Part II: Grammars, Learning, and the Future
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
Jeffrey Heinz
LICS
2012
IEEE
11 years 9 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
CVPR
2000
IEEE
14 years 9 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...