106 search results - page 9 / 22 » Approximating Spanning Trees with Inner Nodes Cost |
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
113
click to vote
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
AINA
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...