1199 search results - page 153 / 240 » Parameterized Proof Complexity |
166
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
160
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
— The DECOS architecture aims at combining the advantages of federated and integrated systems. The DECOS architecture divides the overall system into a set of nearly-independent ...
175
click to vote
ACMMSP
2005
ACM
15 years 12 months ago
2005
ACM
In this work we investigate the impact of evolving memory system features, such as large on-chip caches, automatic prefetch, and the growing distance to main memory on 3D stencil ...
137
click to vote
SPIRE
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
191
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...