Sciweavers

822 search results - page 14 / 165
» Descendants in Increasing Trees
Sort
View
ISVC
2007
Springer
14 years 1 months ago
Tensor Lines in Tensor Fields of Arbitrary Order
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
Mario Hlawitschka, Gerik Scheuermann, Alfred Anwan...
DAC
2001
ACM
14 years 8 months ago
Creating and Exploiting Flexibility in Steiner Trees
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
Elaheh Bozorgzadeh, Ryan Kastner, Majid Sarrafzade...
AINA
2010
IEEE
14 years 22 days ago
Routing Loops in DAG-Based Low Power and Lossy Networks
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
Weigao Xie, Mukul Goyal, Hossein Hosseini, Jerald ...
AAAI
2007
13 years 10 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
CORR
2012
Springer
281views Education» more  CORR 2012»
12 years 3 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong