995 search results - page 169 / 199 » Minimizing Congestion in General Networks |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
CDVE
2004
Springer
14 years 1 months ago
2004
Springer
Not all participants in a collaborative virtual environment (CVE) need to be informed of every other participant’s activities. The technique used for filtering irrelevant message...
ICANN
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
TSP
2008
13 years 7 months ago
2008
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
DAM
1998
13 years 7 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...