830 search results - page 96 / 166 » Route kernels for trees |
158
click to vote
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
136
click to vote
OPODIS
2008
15 years 5 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
151
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
139
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
170
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...