نتایج جستجو برای: edge amount

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

2013
Joseph A. M. Smith

Many sea level rise adaptation plans emphasize the protection of adjacent uplands to allow for inland salt marsh migration, but little empirical information exists on this process. Using aerial photos from 1930 and 2006 of Delaware Estuary coastal habitats in New Jersey, I documented the rate of coastal forest retreat and the rate of inland salt marsh migration across 101.1 km of undeveloped sa...

1996
Colin G. Johnson

It is a common assumption in evolutionary theory that a parent will distribute its resources evenly between a set of equivalent oospring. However this paper presents a theoretical model in which uneven parental investment between a set of equivalent oospring can be a preferred evolutionary strategy to equal investment in the same set of oospring. This eeect does not depend on different oospring...

2017
Mordecai J. Golin Hadi Khodabande Bo Qin

1 CSE Department. Hong Kong UST, [email protected] 2 CE Department. Sharif University of Technology, [email protected] 1 CSE Department. Hong Kong UST, [email protected] Abstract Dynamic Flows were introduced by Ford and Fulkerson in 1958 to model flows over time. They differ from standard network flows by defining edge capacities to be the total amount of flow that can enter an edge in one...

1995
Dimitrios Kagaris Spyros Tragoudas Grammati E. Pantziou Christos D. Zaroliagis

Let N = (V, E, c, /) be a network, where G = (V, E), (VI = n and (El = m, is a directed graph, c(e) > 0 is the capacity and I(e) 2 0 is the lead time for each edge e E E. The transmission time to send u units of data from a given source s to a destination t using path p is T(a,p) = I(p) + &, where 1(p) is the sum of the lead times of the edges in p, and c(p) is the minimum capacity of the edges...

2012
Dong Liu Youbin Chen

In this paper, we present a co amount recognition system for Chinese b system takes color bank check images as inp three main processing steps: numeral s segmentation & recognition, and post-proce sequentially on: detection and extraction of segmentation and recognition of the stri analysis of recognition results for accepta Information fusion, method compleme hypotheses generation then evaluat...

 Abstract: This paper presents the results of an experimental examination of the effect of non-uniform wall temperature on local heat transfer coefficient in a rotating smooth-walled square channel. Three different thermal boundary situations were investigated: (a) even and odd (four) wall uniform temperature, (b) even and odd (four) wall uniform heat flux, and (c) even (leading and trailing) w...

2015
Chinmay Hegde Piotr Indyk Ludwig Schmidt

We introduce a new variant of the Goemans-Williamson (GW) scheme for the Prize-Collecting Steiner Tree Problem (PCST). Motivated by applications in signal processing, the focus of our contribution is to construct a very fast algorithm for the PCST problem that still achieves a provable approximation guarantee. Our overall algorithm runs in time O(dm logn) on a graph with m edges, where all edge...

2006
Claire Tsai Joshua Klayman

When a person is makes a judgment and assesses confidence, what is the effect of receiving more judgment-relevant information? Following up prior research on belief updating judgments (Oskamp, 1965; Slovic, 1973), we demonstrated that the predictive accuracy of experts did not improve but their confidence climbed steadily as they received more information about the target event. Our findings sh...

The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...

Kh. Erfani S. Rahimi Sharbaf

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...

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

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