2303 search results - page 289 / 461 » Interior-Point Methods in Parallel Computation |
146
click to vote
ASAP
2007
IEEE
15 years 10 months ago
2007
IEEE
Existing SIMD extensions cannot efficiently vectorize the histogram function due to memory collisions. We propose two techniques to avoid this problem. In the first, a hierarchi...
145
click to vote
IEEEPACT
2007
IEEE
15 years 10 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
141
click to vote
TOG
2008
15 years 4 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
126
click to vote
NSPW
2004
ACM
15 years 10 months ago
2004
ACM
Agile development methodologies are gaining acceptance in the software industry. If they are to be used for constructing securitycritical solutions, what do we do about assurance?...
124
click to vote
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...