581 search results - page 34 / 117 » An Automata Model for Trees with Ordered Data Values |
190
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
167
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
272
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
167
click to vote
NIPS
2008
15 years 8 months ago
2008
We develop the syntactic topic model (STM), a nonparametric Bayesian model of parsed documents. The STM generates words that are both thematically and syntactically constrained, w...
191
click to vote
GCB
2000
Springer
15 years 10 months ago
2000
Springer
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...