613 search results - page 34 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
223
Voted
VLDB
2006
ACM
16 years 3 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
145
click to vote
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
124
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
107
click to vote
RECOMB
2008
Springer
16 years 3 months ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...