1628 search results - page 82 / 326 » Compiler Construction Using Scheme |
106
Voted
IJCAI
1993
15 years 1 months ago
1993
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...
109
click to vote
INDOCRYPT
2003
Springer
15 years 5 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
SMC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Several studies dealt with medical ultrasound registration. Their similarity metrics relied on pixel-to-pixel intensity comparisons. Hence, they are not well suited to the case...
112
click to vote
ICPP
1992
IEEE
15 years 3 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...