18306 search results - page 327 / 3662 » Algorithmics in Exponential Time |
168
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
192
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
169
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
184
click to vote
MICS
2010
15 years 5 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
177
click to vote
TMI
2010
15 years 5 months ago
2010
—Several different reconstruction algorithms have been proposed for photoacoustic tomography, most of which presuppose that the acoustic properties of the medium are constant and...