3415 search results - page 545 / 683 » Lower Bounds for Kernelizations |
104
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
138
click to vote
ESTIMEDIA
2004
Springer
15 years 9 months ago
2004
Springer
We proposed a hardware accelerator IP for the Tier-1 portion of Embedded Block Coding with Optimal Truncation (EBCOT) used in the JPEG2000 next generation image compression standa...
123
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
120
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
122
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...