نتایج جستجو برای: tree like pipeline

تعداد نتایج: 837692  

2010
Stefan Kluckner

This work introduces an efficient classification pipeline, which provides an accurate semantic interpretation of urban environments by using redundant scene observations. The image-based method integrates both appearance and height data to classify single aerial images. Given the initial classification of highly overlapping images, a projection to a common orthographic 3D world coordinate syste...

2011
Luis Quesada Fernando Berzal Galiano Juan C. Cubero

Typically, formal languages are described by providing a textual BNF-like notation specification, which is then manually annotated for syntax-directed translation. When the use of an explicit model is required, its implementation requires the development of the conversion steps between the model and the grammar, and between the parse tree and the model instance. Whenever the language specificat...

2012
M. R. Miri Lavasani J. Wang Z. Yang J. Finlay

Fault Tree Analysis (FTA) as a Probabilistic Risk Assessment (PRA) method is used to identify basic causes leading to an undesired event, to represent logical relation of these basic causes in leading to the event, and finally to calculate the probability of occurrence of this event. To conduct a quantitative FTA, one needs a fault tree along with failure data of the Basic Events (BEs). Sometim...

2012
Yang Ruan Saliya Ekanayake Mina Rho Haixu Tang Seung-Hee Bae Judy Qiu Geoffrey Fox

The development of next-generation sequencing technology has made it possible to generate millions of sequences from environmental samples. However, the difficulty associated with taxonomy-independent analysis increases as the sequence size expands. Most of the existing algorithms, which aim to generate operational taxonomic units (OTUs), require quadratic space and time complexity that makes t...

Journal: :Discussiones Mathematicae Graph Theory 2014
Tanja Gologranc

Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227–240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and ...

2010

Eucalyptus globulus is a tree used to produce paper pulp. With the aim to study the genes responsible for wood formation in E. globulus, which are not yet fully understood although known to have an impact on the quality of paper pulp, GenEglobwq project was defined. One of the project goals is the development of an annotation module, to automatically annotate the gene sequences obtained. Theref...

Journal: :Electr. J. Comb. 2016
Pawel Hitczenko Amanda Lohss

In this paper, we study tree–like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of corners in tree–like tableaux and the total number of corners in symmetric tree–like tableaux. In this paper, we prove both conjectures. Our proofs are based on ...

Journal: :Theor. Comput. Sci. 1997
Yasubumi Sakakibara Claudio Ferretti

In this paper, we provide a method to accelerate the power of splicing systems. We introduce the splicing systems on trees to be built as partially annealed single strands, that is a quite similar notion and a natural extension of splicing systems on strings. Trees are a common and useful data structure in computer science and have a biological counterpart such as molecular sequences with secon...

2000
Ann Becker Dan Geiger Christopher Meek

We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations encoded in the distribution. The same result is shown to hold also for multivariate strictly positive normal distributions. Our proof uses a new property of conditional independence that hol...

2012
Seth Kulick Ann Bies Justin Mott

Linguistic Data Consortium University of Pennsylvania Philadelphia, PA 19104 {skulick,bies,jmott}@ldc.upenn.edu Abstract This work describes how derivation tree fragments based on a variant of Tree Adjoining Grammar (TAG) can be used to check treebank consistency. Annotation of word sequences are compared both for their internal structural consistency, and their external relation to the rest of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید