Sciweavers

2487 search results - page 176 / 498
» Partitions of Graphs into Trees
Sort
View
125
Voted
AHSWN
2008
92views more  AHSWN 2008»
15 years 3 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
126
Voted
TSP
2010
14 years 10 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
138
Voted
ICCV
2003
IEEE
16 years 5 months ago
Filtering Using a Tree-Based Estimator
Within this paper a new framework for Bayesian tracking is presented, which approximates the posterior distribution at multiple resolutions. We propose a tree-based representation...
Bjoern Stenger, Arasanathan Thayananthan, Philip H...
120
Voted
ICMCS
2005
IEEE
96views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Quad-Tree Motion Estimation in the Frequency Domain
We propose a quad-tree scheme for obtaining sub-pixel estimates of interframe motion in the frequency domain. Our scheme is based on phase correlation and uses motion compensated ...
Vasileios Argyriou, Theodore Vlachos
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 8 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...