Sciweavers

198 search results - page 9 / 40
» Infinite mixtures of trees
Sort
View
ACL
2009
13 years 6 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
ITA
2007
153views Communications» more  ITA 2007»
13 years 8 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 3 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
CVPR
2001
IEEE
14 years 10 months ago
Mixtures of Trees for Object Recognition
Efficient detection of objects in images is complicated by variations of object appearance due to intra-class object differences, articulation, lighting, occlusions, and aspect va...
Sergey Ioffe, David A. Forsyth
BMCBI
2008
134views more  BMCBI 2008»
13 years 8 months ago
Stability analysis of mixtures of mutagenetic trees
Background: Mixture models of mutagenetic trees are evolutionary models that capture several pathways of ordered accumulation of genetic events observed in different subsets of pa...
Jasmina Bogojeska, Thomas Lengauer, Jörg Rahn...