570 search results - page 46 / 114 » Approximating Some Network Design Problems with Node Costs |
117
Voted
KDD
2010
ACM
14 years 12 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
124
click to vote
INTERNET
2006
15 years 1 months ago
2006
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
148
click to vote
ALGOSENSORS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
223
click to vote
DAC
2011
ACM
14 years 1 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
118
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...