3 search results - page 1 / 1 » Binary Searching with Nonuniform Costs and Its Application t... |
ALGORITHMICA
2000
13 years 4 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
ESA
1995
Springer
13 years 8 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
IPM
2006
13 years 4 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...