1093 search results - page 9 / 219 » Fast Abstracts |
PKC
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits....
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
AAECC
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...