405 search results - page 6 / 81 » A Parallel Priority Data Structure with Applications |
163
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
116
Voted
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algor...
124
Voted
HPDC
1998
IEEE
15 years 6 months ago
1998
IEEE
PAWS (Parallel Application WorkSpace) is a software infrastructure for use in connecting separate parallel applications within a component-like model. A central PAWS Controller co...
116
Voted
ICPP
2009
IEEE
15 years 6 days ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
113
Voted
USENIX
2007
15 years 4 months ago
2007
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...