914 search results - page 59 / 183 » Branch and Bound on the Network Model |
MOBICOM
2005
ACM
15 years 3 months ago
2005
ACM
— This paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channe...
JMLR
2006
14 years 9 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
PODC
1997
ACM
15 years 1 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
NCA
2003
IEEE
15 years 3 months ago
2003
IEEE
A lot of research work has recently focused on the exploitation of the DiffServ framework towards building reliable networking services that provide deterministic quality guarante...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...