Sciweavers

10271 search results - page 1703 / 2055
» Self-plagiarism in computer science
Sort
View
FOCS
1990
IEEE
15 years 10 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
ACMSE
2007
ACM
15 years 10 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
BIRTHDAY
2006
Springer
15 years 10 months ago
Some Varieties of Equational Logic
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
Gordon D. Plotkin
ACE
2004
186views Education» more  ACE 2004»
15 years 8 months ago
TinkerNet: A Low-Cost Networking Laboratory
The 2002 SIGCOMM Workshop on Educational Challenges for Computer Networking [Kur02a] exposed many issues related to teaching computer networking with the need for a laboratory in ...
Michael Erlinger, Mart Molle, Titus Winters, Chris...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
15 years 6 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
« Prev « First page 1703 / 2055 Last » Next »