Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
Michael KaufmannJop F. SibeynTorsten SuelPublished in: ESA (1995)
Keyphrases
- worst case
- upper bound
- lower bound
- error bounds
- average case
- greedy algorithm
- np hard
- worst case analysis
- ranking algorithm
- approximation algorithms
- web search
- multiresolution
- complexity bounds
- additive error
- ranking functions
- d mesh
- mistake bound
- computational complexity
- learning to rank
- link analysis
- running times
- neural network
- worst case scenario
- space complexity
- ranked list
- sample size
- web search engines
- mesh refinement