3415 search results - page 362 / 683 » Lower bounds on kernelization |
199
Voted
ECRTS
2005
IEEE
16 years 9 days ago
2005
IEEE
We present a wait-free protocol for the single-writer, multiple-reader problem in small-memory, embedded real-time systems. We analytically establish that our protocol requires le...
180
click to vote
COLT
2004
Springer
16 years 2 days ago
2004
Springer
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
204
click to vote
CPM
1994
Springer
15 years 10 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
153
click to vote
PACS
2000
Springer
15 years 10 months ago
2000
Springer
Dynamic voltage and frequency scaling has been identified as one of the most effective ways to reduce power dissipation. This paper discusses a compilation strategy that identifies...
191
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...