6105 search results - page 879 / 1221 » A Parallel Algorithm for Bound-Smoothing |
169
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
161
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
198
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
A familiar quandary arises when there are several possible alternatives for the solution of a problem, but no way of knowing which, if any, are viable for a particular problem inst...
146
click to vote
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Compact and high-speed hardware architectures and logic optimization methods for the AES algorithm Rijndael are described. Encryption and decryption data paths are combined and all...
180
click to vote
COSPS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Array privatization is one of the most e ective transformations for the exploitation of parallelism. In this paper, we present a technique for automatic array privatizati...