396 search results - page 66 / 80 » An Optimal Minimum Spanning Tree Algorithm |
100
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
149
click to vote
DATAMINE
1999
15 years 1 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
126
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
108
click to vote
SIAMJO
2000
15 years 1 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
154
click to vote
PPOPP
2011
ACM
14 years 4 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...