Sciweavers

19 search results - page 2 / 4
» Challenges and Advances in Parallel Sparse Matrix-Matrix Mul...
Sort
View
WCE
2007
13 years 6 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
ICCS
2009
Springer
13 years 3 months ago
Parallel MLEM on Multicore Architectures
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...
Tilman Küstner, Josef Weidendorfer, Jasmine S...
ECCV
2010
Springer
13 years 6 months ago
Semantic Segmentation of Urban Scenes Using Dense Depth Maps
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Chenxi Zhang, Liang Wang, Ruigang Yang
ICWS
2010
IEEE
13 years 6 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
ECCV
2008
Springer
14 years 7 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...