20 search results - page 4 / 4 » A note on interconnecting matchings in graphs |
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
EUROSYS
2010
ACM
13 years 11 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
SIGCOMM
2004
ACM
13 years 10 months ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
IWCMC
2010
ACM
13 years 7 months ago
2010
ACM
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...