A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects.
Prasad JayantiPublished in: PODC (1998)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity analysis
- branch and bound
- branch and bound algorithm
- computational complexity
- moving objects
- objective function
- d objects
- data objects
- lower and upper bounds
- np hard
- space complexity
- average case complexity
- object model
- spatial relationships
- efficient implementation
- optimal solution
- object segmentation
- memory requirements
- object detection
- computer vision
- individual objects
- lower bounding
- database