Sciweavers

680 search results - page 48 / 136
» A randomized embedding algorithm for trees
Sort
View
AMAI
2005
Springer
13 years 8 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
CGF
2006
107views more  CGF 2006»
13 years 9 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
14 years 1 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 2 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 9 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler