739 search results - page 66 / 148 » Sorting Algorithms |
114
click to vote
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
129
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
119
click to vote
ESA
2000
Springer
15 years 5 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
114
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
229
Voted
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...