Sciweavers

16430 search results - page 392 / 3286
» On Computable Tree Functions
Sort
View
UAI
2000
15 years 8 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
MOBIDE
2010
ACM
15 years 7 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
CGF
2008
143views more  CGF 2008»
15 years 6 months ago
Sketch-Based Procedural Surface Modeling and Compositing Using Surface Trees
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
Ryan Schmidt, Karan Singh
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
15 years 6 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
171
Voted
ALMOB
2008
131views more  ALMOB 2008»
15 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas