4095 search results - page 178 / 819 » How to test a tree |
ICIP
2005
IEEE
14 years 4 months ago
2005
IEEE
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
ICMI
2003
Springer
14 years 4 months ago
2003
Springer
The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition ...
PLDI
1994
ACM
14 years 2 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
AAAI
2010
14 years 7 days ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
AAAI
2006
14 years 5 days ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...