2926 search results - page 513 / 586 » Partially Optimal Routing |
121
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
118
click to vote
AAAI
2010
15 years 2 months ago
2010
Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning assumes that for each instance, the "full" lab...
80
Voted
CCCG
2010
15 years 2 months ago
2010
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
114
Voted
CIMAGING
2008
15 years 2 months ago
2008
We consider the image reconstruction problem when the original image is assumed to be sparse and when partial knowledge of the point spread function (PSF) is available. In particu...
99
Voted
OPODIS
2008
15 years 2 months ago
2008
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...