54 search results - page 4 / 11 » An Algorithm for Solving the Discrete Log Problem on Hyperel... |
147
click to vote
ASIACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
137
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
131
click to vote
CCCG
2008
15 years 5 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
167
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...
133
click to vote
CCCG
2007
15 years 5 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...