3250 search results - page 188 / 650 » Parameterized Learning Complexity |
171
click to vote
FOCS
2005
IEEE
16 years 3 days 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 ...
164
click to vote
IPPS
2005
IEEE
16 years 3 days 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 ...
182
click to vote
RTAS
2005
IEEE
16 years 2 days ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
180
click to vote
ACMMSP
2005
ACM
16 years 2 days 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 ...
146
click to vote
SPIRE
2004
Springer
15 years 12 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...