4176 search results - page 504 / 836 » Parallelizing Support Vector Machines on Distributed Compute... |
208
click to vote
ALENEX
2001
15 years 8 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
180
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increa...
196
click to vote
NN
2002
Springer
15 years 6 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
159
click to vote
CSL
2000
Springer
15 years 11 months ago
2000
Springer
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
212
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
SIMD (single instruction multiple data)-type processors have been found very efficient in image processing applications, because their repetitive structure is able to exploit the...