10608 search results - page 1981 / 2122 » Complexity of O'Hara's Algorithm |
119
click to vote
JOC
2000
15 years 11 days ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
106
Voted
IDA
2002
Springer
15 years 11 days ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
127
click to vote
AC
1998
Springer
15 years 9 days ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
74
Voted
MOC
1998
15 years 7 days ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
118
click to vote
TCAD
1998
15 years 7 days ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...