2853 search results - page 339 / 571 » On Coherence in Computer Algebra |
134
click to vote
CONCUR
1993
Springer
15 years 8 months ago
1993
Springer
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
147
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
Kernel-based methods, e.g., support vector machine (SVM), produce high classification performances. However, the computation becomes time-consuming as the number of the vectors su...
132
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
119
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
141
click to vote
CONCUR
1992
Springer
15 years 8 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...