2563 search results - page 91 / 513 » Parallel matrix algorithms and applications |
111
Voted
PDCN
2004
15 years 2 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
101
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
117
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
114
Voted
SC
2005
ACM
15 years 6 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
105
click to vote
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...