Sciweavers

1199 search results - page 153 / 240
» Parameterized Proof Complexity
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
The Closest Substring problem with small distances
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 ...
Dániel Marx
IPPS
2005
IEEE
14 years 2 months ago
Virtual Gateways in the DECOS Integrated Architecture
— 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 ...
Roman Obermaisser, Philipp Peti, Hermann Kopetz
ACMMSP
2005
ACM
106views Hardware» more  ACMMSP 2005»
14 years 2 months ago
Impact of modern memory subsystems on cache optimizations for stencil computations
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 ...
Shoaib Kamil, Parry Husbands, Leonid Oliker, John ...
SPIRE
2004
Springer
14 years 2 months ago
Longest Motifs with a Functionally Equivalent Central Block
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...
Maxime Crochemore, Raffaele Giancarlo, Marie-Franc...
STACS
2010
Springer
14 years 2 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
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...
Rustem Takhanov