3415 search results - page 556 / 683 » Lower Bounds for Kernelizations |
129
click to vote
FOCS
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
123
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
168
click to vote
CIAC
1994
Springer
15 years 8 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
135
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
146
click to vote
COLT
1992
Springer
15 years 8 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...