220 search results - page 10 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
137
click to vote
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
142
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
AIME
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepa...
118
click to vote
COMCOM
2010
14 years 12 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
104
click to vote
CONPAR
1992
15 years 3 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...