6437 search results - page 908 / 1288 » Parallel Algorithms for Arrangements |
162
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...
200
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...
150
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...
183
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...
170
click to vote
APCSAC
2000
IEEE
15 years 11 months ago
2000
IEEE
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...