613 search results - page 30 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
AAAI
2006
14 years 11 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
105
click to vote
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
92
Voted
ML
2010
ACM
14 years 8 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...