539 search results - page 8 / 108 » The N R One Time Password System |
ISAAC
2003
Springer
14 years 8 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The asynchronous systems f are the models of the asynchronous circuits from digital electrical engineering. They are multi-valued functions that associate to each input u : R {0, ...
IJCAI
1993
13 years 8 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
CCCG
2003
13 years 8 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
DCG
2007
13 years 7 months ago
2007
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...