Sciweavers

672 search results - page 97 / 135
» Lower-stretch spanning trees
Sort
View
SOFSEM
1997
Springer
13 years 11 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
CISS
2007
IEEE
13 years 11 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
COMPLEX
2009
Springer
13 years 11 months ago
Allometric Scaling of Weighted Food Webs
Allometric scaling is an important universal property of metabolic living systems. It also describes the self-similar branching treeliked structures in transportation networks. Thi...
Jiang Zhang
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 11 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
EMNLP
2007
13 years 9 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii