Sciweavers

2941 search results - page 108 / 589
» The Myth of the Educational Computer
Sort
View
SIGCSE
1998
ACM
104views Education» more  SIGCSE 1998»
14 years 2 months ago
Scaling: a design pattern in introductory computer science courses
We present a series of programming exercises that use scaling as a theme for teaching design techniques in the introductory computer science course sequence. All exercises are on ...
Harriet J. Fell, Viera K. Proulx, Richard Rasala
SIGCSE
1995
ACM
166views Education» more  SIGCSE 1995»
14 years 1 months ago
An interactive lecture approach to teaching computer science
Students get more out of an interactive lecture than a passive lecture because they are given time to think. This time allows them to determine if they understand a concept, and i...
Susan H. Rodger
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 10 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 10 months ago
A general computation rule for lossy summaries/messages with examples from equalization
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Fr...
CORR
2007
Springer
103views Education» more  CORR 2007»
13 years 10 months ago
HORPO with Computability Closure : A Reconstruction
This paper provides a new, decidable definition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for...
Frédéric Blanqui, Jean-Pierre Jouann...