Sciweavers

650 search results - page 38 / 130
» On Coalgebras over Algebras
Sort
View
TIT
2011
169views more  TIT 2011»
13 years 2 months ago
Network Coding Theory Via Commutative Algebra
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Shuo-Yen Robert Li, Qifu Tyler Sun
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
FMICS
2008
Springer
13 years 9 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
ISCI
2010
103views more  ISCI 2010»
13 years 6 months ago
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
Carles Noguera, Francesc Esteva, Lluis Godo
ICDE
2008
IEEE
191views Database» more  ICDE 2008»
14 years 9 months ago
An Algebraic Approach to Rule-Based Information Extraction
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
Frederick Reiss, Sriram Raghavan, Rajasekar Krishn...