6045 search results - page 915 / 1209 » Computable Linearizations of Well-partial-orderings |
149
click to vote
LPAR
1994
Springer
15 years 10 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
142
click to vote
VLDB
1989
ACM
15 years 10 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
165
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
165
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
185
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...