2252 search results - page 312 / 451 » Lower Bounds for Dynamic Algorithms |
117
Voted
COLT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
105
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
122
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
116
click to vote
ICOIN
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. TFRC (TCP Friendly Rate Control) is a rate-based congestion control protocol for non-TCP flows. TFRC controls the sending rate by using the TCP throughput equation consi...
159
Voted
CONCUR
1997
Springer
15 years 7 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...