358 search results - page 32 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
129
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
144
click to vote
SIGCOMM
2012
ACM
13 years 4 months ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
146
click to vote
HIPC
2009
Springer
14 years 11 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
121
click to vote
CLUSTER
2004
IEEE
15 years 1 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
ICIAP
2007
ACM
16 years 2 months ago
2007
ACM
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...