1494 search results - page 266 / 299 » Polynomial time algorithms for network information flow |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
BIOADIT
2006
Springer
14 years 12 days ago
2006
Springer
Bandwidth demands of communication networks are rising permanently. Thus, the requirements to modern routers regarding packet classification are rising accordingly. Conventional al...
PERCOM
2009
ACM
14 years 3 months ago
2009
ACM
—Contexts, the pieces of information that capture the characteristics of computing environments, are often inconsistent in the dynamic and uncertain pervasive computing environme...
CP
2007
Springer
14 years 18 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...