405 search results - page 29 / 81 » A Parallel Priority Data Structure with Applications |
132
Voted
EGPGV
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
114
Voted
HPDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Structured Overlay Networks provide a promising platform for high performance applications since they are scalable, fault-tolerant and self-managing. Structured overlays provide l...
110
Voted
DEBS
2007
ACM
15 years 4 months ago
2007
ACM
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
159
Voted
TPDS
2010
15 years 29 days ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
149
click to vote
EUROPAR
1998
Springer
15 years 6 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...