نتایج جستجو برای: flow paths

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

ژورنال: اقیانوس شناسی 2022

Background and Objectives: Influence of water mass on sound propagation in the Gulf of Aden underwater acoustics used for communication, navigation and identification of objects by both humans and marine mammals and for investigating the detrimental effects of anthropogenic activities (e.g. pile driving, seismic survey and ships) on marine animals. The Gulf of Aden presents a unique ecosystem t...

Journal: :Communications for Statistical Applications and Methods 2002

Journal: :Journal of vision 2013
Georgios K Kountouriotis Katy A Shire Callum D Mole Peter H Gardner Natasha Merat Richard M Wilkie

How do animals and insects use visual information to move through the world successfully? Optic flow, the pattern of motion at the eye, is a powerful source of information about self-motion. Insects and humans are sensitive to the global pattern of optic flow and try to maintain flow symmetry when flying or walking. The environments humans encounter, however, often contain demarcated paths that...

2007
Siddharth Barman Shuchi Chawla

Problem Statement: Given a directed graphG and a set of terminal pairs {(s1, t1), (s2, t2), · · · , (sk, tk)}, our goal is to connect as many pairs as possible using non edge intersecting paths. Edge disjoint paths problem is NP-Complete and is closely related to the multicommodity flow problem. In fact integer multicommodity flow is a generalization of this problem. We describe a greedy approx...

2016
Winnie Chu Timothy T. Creyts Robin E. Bell

Investigations of the Greenland ice sheet’s subglacial hydrological system show that the connectivity of different regions of the system influences how the glacier velocity responds to variations in surface melting. Here we examine whether subglacial water flow paths can be rerouted beneath three outlet glaciers in the ablation zone of western Greenland. We use Lamont-Doherty and Center for Rem...

2010
Guyslain Naves Nicolas Sonnerat Adrian Vetta

We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path. Our main result is an Ω(log n) lower bound on the approximability of the problem. We also show th...

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

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