739 search results - page 50 / 148 » Sorting Algorithms |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
TCS
2010
13 years 7 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
SEAL
2010
Springer
13 years 7 months ago
2010
Springer
During engineering design, it is often difficult to quantify product reliability because of insufficient data or information for modeling the uncertainties. In such cases, one need...