148 search results - page 10 / 30 » DisNet: A Framework for Distributed Graph Computation |
80
Voted
ISCOPE
1999
Springer
15 years 1 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
102
click to vote
EUROPAR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
93
Voted
ICPP
1999
IEEE
15 years 1 months ago
1999
IEEE
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
101
click to vote
MOBIHOC
2012
ACM
12 years 12 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
DCC
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...