2612 search results - page 280 / 523 » Switching Graphs and Their Complexity |
155
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
138
click to vote
MSN
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
157
click to vote
ACSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
149
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
151
Voted
ISCAS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...