4112 search results - page 372 / 823 » Efficient Algorithms for the Spoonerism Problem |
209
click to vote
APPROX
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
183
click to vote
ECCC
2006
15 years 7 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
186
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
197
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
250
click to vote
ERCIMDL
2000
Springer
15 years 11 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...