Sciweavers

1146 search results - page 93 / 230
» Finite cupping sets
Sort
View
CPC
2008
65views more  CPC 2008»
13 years 9 months ago
The Distribution of Patterns in Random Trees
Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finite, unlabeled) tree. Assuming that every tree of Tn is equally likely, it is shown that the...
Frédéric Chyzak, Michael Drmota, Tho...
CORR
2006
Springer
106views Education» more  CORR 2006»
13 years 9 months ago
Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources
A sequential updating scheme (SUS) for belief propagation (BP) decoding of LDPC codes over Galois fields, GF
Nadav Yacov, Hadar Efraim, Haggai Kfir, Ido Kanter...
FMSD
2006
77views more  FMSD 2006»
13 years 9 months ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
IJAC
2006
67views more  IJAC 2006»
13 years 9 months ago
Conjugacy Invariants of Subshifts: an Approach from Profinite Semigroup Theory
: It is given a structural conjugacy invariant in the set of pseudowords whose finite factors are factors of a given subshift. Some profinite semigroup tools are developed for this...
Alfredo Costa
CI
2004
75views more  CI 2004»
13 years 9 months ago
Utility Functions for Ceteris Paribus Preferences
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...
Michael McGeachie, Jon Doyle