125 search results - page 19 / 25 » N Semantic Classes are Harder than Two |
112
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Software Transactional Memory (STM) is a generic synchronization construct that enables automatic conversion of correct sequential objects into correct nonblocking concurrent obje...
99
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Inspired by the recent development of optical queueing theory, in this paper we study a class of multistage interconnection networks (MINs), called twister networks. Unl...