10608 search results - page 531 / 2122 » Complexity of O'Hara's Algorithm |
163
Voted
STOC
2006
ACM
16 years 6 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
163
click to vote
ACIVS
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
149
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
147
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
136
click to vote
UAI
1996
15 years 7 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...