4009 search results - page 675 / 802 » Clustering on Complex Graphs |
175
click to vote
FGCS
2002
15 years 4 months ago
2002
Initial versions of MPI were designed to work efficiently on multi-processors which had very little job control and thus static process models. Subsequently forcing them to suppor...
137
click to vote
CGF
1998
15 years 4 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
135
click to vote
PAMI
1998
15 years 4 months ago
1998
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
141
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Developing large-scale distributed applications can be a daunting task. One of the problems that application developers are confronted with is the distribution of data, processes, ...
144
click to vote
IEEECIT
2010
IEEE
15 years 3 months ago
2010
IEEE
- The increase of embedded applications complexity has demanded hardware more flexible while providing higher performance. Reconfigurable architectures and stream processing have b...