973 search results - page 161 / 195 » New Bounds on Crossing Numbers |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
IJCAI
1997
13 years 9 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
IJCAI
1993
13 years 9 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
ALENEX
2009
13 years 9 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
ALT
2010
Springer
13 years 8 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...