Sciweavers

326 search results - page 44 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
ECSQARU
2009
Springer
14 years 4 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
INFOCOM
2008
IEEE
14 years 4 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
FSTTCS
2005
Springer
14 years 3 months ago
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
Sathya Peri, Neeraj Mittal
IPSN
2009
Springer
14 years 4 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...