19 search results - page 4 / 4 » The height of q-Binary Search Trees |
115
Voted
CORR
2010
Springer
15 years 15 days ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
ICDAR
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we will present a comprehensive voting approach, taking entire layouts obtained from commercial OCR devices as input. Such a layout comprises segments of three kind...
AAAI
2000
15 years 1 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
104
click to vote
WISEC
2010
ACM
14 years 10 months ago
2010
ACM
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...