153 search results - page 15 / 31 » Uniformity Testing Using Minimal Spanning Tree |
118
click to vote
AINA
2005
IEEE
15 years 5 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
105
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
132
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
91
Voted
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...