2168 search results - page 1 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
RANDOM
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
FUIN
2000
13 years 5 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
ISVC
2007
Springer
13 years 11 months ago
2007
Springer
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
CORR
2012
Springer
12 years 27 days ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...