نتایج جستجو برای: tree connection

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

Journal: :Applied optics 1997
H M Ozaktas

By systematically examining the tree of possibilities for optoelectronic computing architectures and offering arguments that allow one to prune suboptimal branches of this tree, I come to the conclusion that electronic circuit planes interconnected optically according to regular connection patterns represent an alternative that is reasonably close to the best possible, as defined by physical li...

Journal: :Discrete Applied Mathematics 2001
Malwina J. Luczak Steven D. Noble

We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree topology is at most a given value. We show that data arrangement is strongly NP-complete for any fixed d ≥ 2 and explain the connection between data arrangement and ar...

Journal: :Physical review 2021

Affine gravity is a connection-based formulation of that does not involve metric. After review basic properties affine gravity, we compute the tree-level scattering amplitude scalar particles interacting gravitationally via connection in curved spacetime. We find that, while classically equivalent to general relativity, differs from metric quantum gravity.

2013
WU KEHE

In the electric GIS, facilities in different voltage levels show a different proportion, and topological relations exist in line and point. According to the limitations in multi-scale representation and topological connection of traditional spatial index, an extended R-Tree model based on multi-scale clustering(MCER Tree) is proposed, which removed the restrictions of the same height of all lea...

Journal: :Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention 2005
Julien Jomier Vincent LeDigarcher Stephen R. Aylward

We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimization criterion of the Mahalanobis distance. First, a multivariate class of connected junctions is defined using a set of trained vascular trees and their corresponding image volumes. Second, a minimum spanning tree alg...

2006
Antal A. Járai Frank Redig

We study the Abelian sandpile model on Z. In d ≥ 3 we prove existence of the infinite volume addition operator, almost surely with respect to the infinite volume limit μ of the uniform measures on recurrent configurations. We prove the existence of a Markov process with stationary measure μ, and study ergodic properties of this process. The main techniques we use are a connection between the st...

2006
Babak Behsaz Mohammad Rahmati

Estimation of probability density function is inevitable in some engineering systems, specially in statistical pattern recognition systems. One category of methods applied for estimation is tree dependence methods, which could be classified under nonparametric estimation approaches. In this paper, we surveyed important tree dependence methods. To do this, we pursued a mathematically rigorous ma...

2017
Weibo Qi Junjie Zhao Guping Shi Fan Yang

BACKGROUND Pulmonary sequestration is a relatively rare condition in which a systemic artery supplies blood to an abnormal lung tissue and the normal connection with the bronchial tree is absent. It can be displayed as various signs on the computed tomography image, but emphysema is extremely rare. CASE PRESENTATION We describe the case of a 35-year-old man with intralobar pulmonary sequestra...

2015
Thorsten Altenkirch Bahareh Afshari Stefan Hetzl

Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut elimination for proofs in first-order predicate logic involving Π1-cuts corresponds to computing the language of a particular class of regular tree grammars. The present paper expands this connection to the level of Π2-cuts. Given a proof π of a Σ1 formula with cuts o...

2014
Charles Grellois Paul-André Melliès

In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection type system associated to the automaton A . The purpose of this article is to establish a clean connection between this line of work and Bucciare...

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

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