4962 search results - page 681 / 993 » Connectivity in Sub-Poisson Networks |
142
click to vote
NIPS
2000
15 years 8 months ago
2000
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
168
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
178
click to vote
CN
2006
15 years 6 months ago
2006
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
207
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—Conventional wisdom about 802.11 WLANs dictates that as the number of active users increases, the contention windows (CW) of all the contending users needs to increase to preven...