4137 search results - page 205 / 828 » On the number of matchings of a tree |
202
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
188
click to vote
ESA
2005
Springer
16 years 2 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
182
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
154
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...