186 search results - page 28 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
SAMOS
2009
Springer
14 years 2 months ago
2009
Springer
Tomography is a powerful technique for three-dimensional imaging, that deals with image reconstruction from a series of projection images, acquired along a range of viewing directi...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
ICPP
2000
IEEE
13 years 12 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
AIMSA
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...