2626 search results - page 249 / 526 » The complexity of stochastic sequences |
187
click to vote
PAIRING
2007
Springer
16 years 22 days ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
182
click to vote
SAINT
2006
IEEE
16 years 19 days ago
2006
IEEE
There are many kinds of control networks, which have been used in various non-IP network areas, such as BA (Building Automation), FA (Factory Automation) and PA (Process Automatio...
157
click to vote
APLAS
2006
ACM
16 years 18 days ago
2006
ACM
The abstract domain of polyhedra is sufficiently expressive to be deployed in verification. One consequence of the richness of this domain is that long, possibly infinite, sequen...
193
click to vote
ATAL
2005
Springer
16 years 5 days ago
2005
Springer
We present an integrated approach for reasoning about and learning conversation patterns in multiagent communication. The approach is based on the assumption that information abou...
168
click to vote
BIRTHDAY
2005
Springer
16 years 5 days ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...