نتایج جستجو برای: upward communication

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

2009
Markus Chimani Carsten Gutwenger Petra Mutzel Hoi-Ming Wong

Abstract. Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straight-forward approaches for drawing such...

Journal: :Journal of Medical Toxicology 2014

Journal: :Journal of the ACM 2017

Journal: :ACS Chemical Neuroscience 2016

Journal: :Mathematical Logic Quarterly 2013

1995
Luc Moreau

A method of preserving the sequential semantics in parallel programs with rst-class continuations is to invoke continuations non-speculatively. This method, which prevents a continuation from being invoked as long as its invocation can infringe the sequential semantics, reduces parallelism by the severe conditions that it imposes, especially on upward uses. In this paper, we present new conditi...

1998
Teresa Montaruli

MACRO can detect three topologies of neutrino induced events, corresponding to different parent neutrino energies. The most numerous sample is made of upward throughgoing muons induced by atmospheric neutrinos of average energy 100 GeV. The ratio of the observed over the expected events is 0.74 ± 0.036stat ± 0.046sys ± 0.13theor. The observed zenith distribution does not fit the expected one in...

Journal: :The Journal of experimental biology 2007
Joseph A C Humphrey Deforest Mellon

Analytical and numerical methodologies are combined to investigate the flow fields that approach and pass around the lateral flagellum of the crayfish Procambarus clarkii. Two cases are considered, the first being that of a free-flicking flagellum and the second corresponding to a flagellum fixed inside a small bore tube. The first case is the natural one while the second corresponds to the exp...

2007
Ashim Garg Michael T. Goodrich Roberto Tamassia

Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.

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

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