752 search results - page 122 / 151 » Faster approximation algorithms for the minimum latency prob... |
127
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
121
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
107
Voted
AAAI
1998
15 years 4 months ago
1998
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
120
Voted
PAMI
2008
15 years 3 months ago
2008
In this work, we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the ...
198
Voted
CANS
2011
Springer
14 years 3 months ago
2011
Springer
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...