642 search results - page 106 / 129 » Approximation Algorithms for Minimum K-Cut |
HICSS
2003
IEEE
14 years 2 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
JSAC
2006
13 years 9 months ago
2006
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...