Sciweavers

103 search results - page 2 / 21
» Complete Iterativity for Algebras with Effects
Sort
View
ICALP
1997
Springer
13 years 9 months ago
Axiomatizations for the Perpetual Loop in Process Algebra
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...
Wan Fokkink
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
13 years 9 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 5 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
VTC
2007
IEEE
108views Communications» more  VTC 2007»
13 years 11 months ago
Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping
— The intentionally imposed or inherent unintentional residual redundancy found in source encoded bitstreams can be exploited for supporting joint SoftBit-Source Decoding and Cha...
Anh Quang Pham, Lie-Liang Yang, Lajos Hanzo
JSYML
2008
74views more  JSYML 2008»
13 years 5 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...