753 search results - page 29 / 151 » Completing a (k - 1)-Assignment |
228
click to vote
HICSS
2010
IEEE
15 years 9 months ago
2010
IEEE
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
217
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
172
Voted
CPM
2001
Springer
15 years 12 months ago
2001
Springer
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
203
click to vote
DM
2008
15 years 7 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
195
click to vote
IPL
2008
15 years 7 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...