109 search results - page 19 / 22 » Large independent sets in regular graphs of large girth |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
FTTCS
2006
13 years 9 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
SADM
2011
13 years 4 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...