6110 search results - page 76 / 1222 » Approximate Computing |
103
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
103
Voted
ASIACRYPT
1999
Springer
15 years 7 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
101
click to vote
SIAMJO
2008
15 years 2 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
231
Voted
ICGA
2006
17 years 2 months ago
2006
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
107
Voted
ICCSA
2003
Springer
15 years 7 months ago
2003
Springer
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...