Sciweavers

2503 search results - page 151 / 501
» A study of 3-arc graphs
Sort
View
IPPS
2006
IEEE
16 years 17 days ago
Parallel calculation of volcanoes for cryptographic uses
Elliptic curve cryptosystems are nowadays widely used in the design of many security devices. Nevertheless, since not every elliptic curve is useful for cryptographic purposes, me...
Santi Martínez, R. Tomas, C. Roig, Magda Va...
PLDI
2006
ACM
16 years 15 days ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
16 years 4 days ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
16 years 2 days ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
16 years 1 days ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche