Sciweavers

785 search results - page 1 / 157
» Binary Join Trees
Sort
View
UAI
1996
13 years 6 months ago
Binary Join Trees
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...
Prakash P. Shenoy
ECSQARU
2003
Springer
13 years 10 months ago
Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
Weiru Liu, Xin Hong, Kenneth Adamson
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
13 years 10 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez
ENTCS
2002
90views more  ENTCS 2002»
13 years 4 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing
EJWCN
2010
115views more  EJWCN 2010»
12 years 11 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...