830 search results - page 96 / 166 » Route kernels for trees |
113
click to vote
HPCC
2007
Springer
15 years 3 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...
OPODIS
2008
15 years 1 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 ...
GLOBECOM
2010
IEEE
14 years 10 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...
ICASSP
2009
IEEE
15 years 6 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...
124
click to vote
COLT
2010
Springer
14 years 10 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...