Sciweavers

1792 search results - page 23 / 359
» What Are We Arguing About
Sort
View
SIGCSE
2006
ACM
119views Education» more  SIGCSE 2006»
14 years 1 months ago
Practice what you preach: full separation of concerns in CS1/CS2
We argue that the failure to separate the concerns in CS1 is the leading cause of difficulty in teaching OOP in the first year. We show how the concerns can be detangled and prese...
Hamzeh Roumani
ICML
1998
IEEE
14 years 8 months ago
The Case against Accuracy Estimation for Comparing Induction Algorithms
We analyze critically the use of classi cation accuracy to compare classi ers on natural data sets, providing a thorough investigation using ROC analysis, standard machine learnin...
Foster J. Provost, Tom Fawcett, Ron Kohavi
JOC
2002
76views more  JOC 2002»
13 years 7 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
IPPS
2008
IEEE
14 years 2 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
SIGPLAN
2008
13 years 7 months ago
Some thoughts on teaching programming and programming languages
It is argued that the teaching of programming is central to the education of skilled computer professionals, that the teaching of programming languages is central to the teaching ...
John C. Reynolds