2634 search results - page 4 / 527 » Faster Than Uppaal |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
ATMOS
2008
13 years 9 months ago
2008
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...
EDM
2008
13 years 9 months ago
2008
We present text replays, a method for generating labels that can be used to train classifiers of student behavior. We use this method to label data as to whether students are gamin...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
We present a bitsliced implementation of AES encryption in counter mode for 64-bit Intel processors. Running at 7.59 cycles/byte on a Core 2, it is up to 25% faster than previous i...
SSDBM
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...