790 search results - page 36 / 158 » Subexponential Parameterized Algorithms |
148
click to vote
CATS
2008
15 years 4 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
119
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
132
Voted
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
210
Voted
ICSE
2007
IEEE-ACM
16 years 2 months ago
2007
IEEE-ACM
Type safety and expressiveness of many existing Java libraries and their client applications would improve, if the libraries were upgraded to define generic classes. Efficient and...
113
Voted
NCA
2008
IEEE
15 years 9 months ago
2008
IEEE
Distributed storage systems apply erasure-tolerant codes to guarantee reliable access to data despite failures of storage resources. While many codes can be mapped to XOR operatio...