680 search results - page 56 / 136 » A randomized embedding algorithm for trees |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
HICSS
2009
IEEE
14 years 3 months ago
2009
IEEE
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
CORR
2010
Springer
13 years 3 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...
DCC
2000
IEEE
14 years 1 months ago
2000
IEEE
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...