4176 search results - page 180 / 836 » Parallelizing Support Vector Machines on Distributed Compute... |
176
click to vote
ICPP
1993
IEEE
15 years 10 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
214
click to vote
ICPP
1994
IEEE
15 years 10 months ago
1994
IEEE
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
177
click to vote
CIAC
2000
Springer
15 years 10 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
207
click to vote
GRID
2003
Springer
15 years 11 months ago
2003
Springer
There is a rapidly growing set of applications, referred to as data driven applications, in which analysis of large amounts of data drives the next steps taken by the scientist, e...
170
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Distributed Computing, the exploitation of idle cycles on pervasive desktop PC systems offers the opportunity to increase the available computing power by orders of magnitude (10x...