1000 search results - page 108 / 200 » Dependency Tree Automata |
111
click to vote
ICCV
2001
IEEE
16 years 2 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
104
Voted
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
112
Voted
IBPRIA
2007
Springer
15 years 7 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
TYPES
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
108
click to vote
PLDI
1994
ACM
15 years 4 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...