417 search results - page 33 / 84 » Running Time Predictions for Factoring Algorithms |
76
Voted
EMSOFT
2007
Springer
15 years 3 months ago
2007
Springer
With multicore architectures being introduced to the market, the research community is revisiting problems to evaluate them under the new preconditions set by those new systems. A...
68
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
74
Voted
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
86
Voted
NETWORK
2011
14 years 4 months ago
2011
Inferring the subjective perception of a video stream in real time continues to be a stiff problem. This article presents MintMOS: a lightweight, no-reference, loadable kernel mod...