10539 search results - page 376 / 2108 » On L |
161
Voted
SWAT
1998
Springer
15 years 11 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
190
Voted
PKC
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
170
click to vote
CCCG
1993
15 years 8 months ago
1993
An l-ruler is a chain of n links, each of length l. The links, which are allowed to cross, are modeled by line segments whose endpoints act as joints. A given configuration of an ...
187
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
191
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...