Sciweavers

1096 search results - page 16 / 220
» Computation Slicing: Techniques and Theory
Sort
View
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
CHI
2009
ACM
13 years 8 months ago
A performance model of selection techniques for p300-based brain-computer interfaces
In this paper, we propose a model to predict the performance of selection techniques using Brain-Computer Interfaces based on P300 signals. This model is based on Markov theory an...
Jean-Baptiste Sauvan, Anatole Lécuyer, Fabi...
ICSE
2003
IEEE-ACM
14 years 7 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel
SIGCSE
1998
ACM
116views Education» more  SIGCSE 1998»
14 years 3 hour ago
Constructivism in computer science education
ions, and (c) the seductive reality of the computer must not be allowed to supplant construction of models. The dominant theory of learning today is called constructivism. This the...
Mordechai Ben-Ari
IPPS
1999
IEEE
14 years 1 days ago
A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
Jan Jonsson