Sciweavers

19 search results - page 4 / 4
» The height of q-Binary Search Trees
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 5 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
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...
Dustin Wehr
ICDAR
1999
IEEE
13 years 10 months ago
MergeLayouts: Overcoming Faulty Segmentations by a Comprehensive Voting of Commercial OCR Devices
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...
Stefan Klink, Thorsten Jäger
AAAI
2000
13 years 7 months ago
On Pruning Techniques for Multi-Player Games
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...
Nathan R. Sturtevant, Richard E. Korf
WISEC
2010
ACM
13 years 3 months ago
Preventing multi-query attack in location-based services
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...
Nilothpal Talukder, Sheikh Iqbal Ahamed