1253 search results - page 9 / 251 » order 2000 |
JOC
2000
13 years 8 months ago
2000
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
MOC
1998
13 years 8 months ago
1998
By splitting a given singular function into a relatively smooth part and a specially structured singular part, it is shown how the traditional Fourier method can be modified to gi...
ANLP
1997
13 years 10 months ago
1997
We describe an annotation scheme and a tool developed for creating linguistically annotated corpora for non-configurational languages. Since the requirements for such a formalism ...
NDJFL
1998
13 years 8 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
ASM
2000
ASM
14 years 27 days ago
2000
ASM
Abstract. We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoni...