Sciweavers

11740 search results - page 2192 / 2348
» More Problems in Rewriting
Sort
View
CF
2010
ACM
14 years 3 months ago
Load balancing using dynamic cache allocation
Supercomputers need a huge budget to be built and maintained. To maximize the usage of their resources, application developers spend time to optimize the code of the parallel appl...
Miquel Moretó, Francisco J. Cazorla, Rizos ...
COMPGEOM
2010
ACM
14 years 3 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
UM
2010
Springer
14 years 3 months ago
Modeling Individualization in a Bayesian Networks Implementation of Knowledge Tracing
The field of intelligent tutoring systems has been using the well known knowledge tracing model, popularized by Corbett and Anderson (1995) to track individual users’ knowledge f...
Zachary A. Pardos, Neil T. Heffernan
CSFW
2002
IEEE
14 years 3 months ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe
FOCS
2002
IEEE
14 years 3 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
« Prev « First page 2192 / 2348 Last » Next »