Sciweavers

581 search results - page 34 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Detecting and Parsing Architecture at City Scale from Range Data
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...
Alexander Toshev, Philippos Mordohai, Ben Taskar
FSTTCS
2003
Springer
15 years 11 months ago
Reachability Analysis of Process Rewrite Systems
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...
Ahmed Bouajjani, Tayssir Touili
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 6 months ago
Satisfiability of downward XPath with data equality tests
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...
Diego Figueira
NIPS
2008
15 years 7 months ago
Syntactic Topic Models
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...
Jordan L. Boyd-Graber, David M. Blei
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 9 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
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...
Dirk Husmeier, Frank Wright