9842 search results - page 1358 / 1969 » Problem complexity |
227
Voted
FPGA
2005
ACM
16 years 25 days ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
244
Voted
PVG
2003
IEEE
16 years 17 days ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
196
Voted
COMPGEOM
2003
ACM
16 years 17 days ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
263
Voted
COMPGEOM
2010
ACM
16 years 11 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
204
Voted
GECCO
2010
Springer
16 years 3 days ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...