7988 search results - page 1099 / 1598 » A Useful Undecidable Theory |
168
click to vote
SIGCOMM
1996
ACM
15 years 11 months ago
1996
ACM
Prior work in the eld of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insucient to model interference...
192
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
182
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
236
click to vote
CIKM
1994
Springer
15 years 11 months ago
1994
Springer
We investigate the semantics for Knowledge Query Manipulation Language KQML and we propose a semantic framework for the language. KQML is a language and a protocol to support comm...
181
click to vote
COLT
1994
Springer
15 years 11 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...