1640 search results - page 69 / 328 » Conditional Independence Trees |
105
Voted
IANDC
2007
15 years 2 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
115
Voted
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
123
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
98
Voted
IJCAI
1989
15 years 3 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
JSYML
2011
14 years 9 months ago
2011
Abstract. We give an affirmative answer to Brendle’s and Hruˇs´ak’s question of whether the club principle together with h > ℵ1 is consistent. We work with a class of ax...