Sciweavers

3415 search results - page 545 / 683
» Lower bounds on kernelization
Sort
View
109
Voted
COLT
2004
Springer
15 years 10 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
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...
Dana Angluin, Jiang Chen
143
Voted
ESTIMEDIA
2004
Springer
15 years 10 months ago
A hardware accelerator IP for EBCOT Tier-1 coding in JPEG2000 Standard
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...
Tien-Wei Hsieh, Youn-Long Lin
129
Voted
FSTTCS
2004
Springer
15 years 10 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
128
Voted
GD
2004
Springer
15 years 10 months ago
No-Three-in-Line-in-3D
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...
Attila Pór, David R. Wood
ICALP
2004
Springer
15 years 10 months ago
Linear and Branching Metrics for Quantitative Transition Systems
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...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...