1534 search results - page 153 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
117
click to vote
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
96
Voted
VLDB
1994
ACM
15 years 5 months ago
1994
ACM
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
159
Voted
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
89
Voted
ICPADS
2007
IEEE
15 years 7 months ago
2007
IEEE
—The main concern of the Internet user-base has shifted from what kind of information are available to how to find the desired information on the Internet thanks to the explosiv...
119
Voted
PPAM
2007
Springer
15 years 7 months ago
2007
Springer
Lattice-Boltzmann (LB) methods are a well-known technique in the context of computational fluid dynamics. By nature, they can easily be parallelized but their adaptation to the Gr...