16430 search results - page 61 / 3286 » On Computable Tree Functions |
119
click to vote
DEXA
2003
Springer
15 years 7 months ago
2003
Springer
XML is rapidly becoming one of the most adopted standard for information representation and interchange over the Internet. With the proliferation of mobile devices of communication...
121
click to vote
ICALP
1990
Springer
15 years 6 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
123
click to vote
UAI
1997
15 years 3 months ago
1997
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
177
click to vote
CC
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
118
Voted
GD
2007
Springer
15 years 8 months ago
2007
Springer
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...