4894 search results - page 135 / 979 » Choices |
188
click to vote
ISSTA
2004
ACM
16 years 10 days ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
157
click to vote
ANTS
2004
Springer
16 years 9 days ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
160
click to vote
CTRSA
2003
Springer
16 years 3 days ago
2003
Springer
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
164
click to vote
TIME
2002
IEEE
15 years 11 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
149
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...