418 search results - page 4 / 84 » A relaxation-based algorithm for solving the conditional p-c... |
ANTS
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
ICRA
2003
IEEE
14 years 23 days ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
PCM
2009
Springer
14 years 2 months ago
2009
Springer
A picture is blurred when it is taken by the mobile phone camera in dim light conditions. There are some hardware approaches for commercial use to solve this problem, but they cost...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...