405 search results - page 42 / 81 » A Parallel Priority Data Structure with Applications |
130
click to vote
DAWAK
2001
Springer
15 years 7 months ago
2001
Springer
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
144
Voted
TPDS
1998
15 years 2 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
116
click to vote
WADS
1989
Springer
15 years 7 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
128
click to vote
HIPC
2009
Springer
15 years 1 months ago
2009
Springer
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
148
Voted
ICDCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Application-layer overlay networks have recently emerged as a promising solution for live media multicast on the Internet. A tree is probably the most natural structure for a mult...