نتایج جستجو برای: edge
تعداد نتایج: 112400 فیلتر نتایج به سال:
It is widely accepted that responses from onand o -center cells give rise to edges and are equivalent to edge detectors. In this paper, we point out that onand o -center cell responses provide more information than edges. We show that an edge-based representation makes the ownership of boundaries ambiguous and requires a combinatorial search to model perceptual grouping. By analyzing the di ere...
abstract. suppose g is an nvertex and medge simple graph with edge set e(g). an integervalued function f: e(g) → z is called a flow. tutte was introduced the flow polynomial f(g, λ) as a polynomial in an indeterminate λ with integer coefficients by f(g,λ) in this paper the flow polynomial of some dendrimers are computed.
forest fragmentation results in a loss of forest interior and an increase in edge habitat. we studied how understorey bird community composition and habitat variables changed along an edge-to-interior gradient in a 1248-ha lowland rainforest patch in peninsular malaysia. birds and environmental variables such as vegetation structure and litter depth were detected within a 25-m radius of each of...
The topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
We study the coherent spin-polarized transport through a zigzag-edge graphene flake (ZGF), using Hubbard model in the nearest neighbor approximation within the framework of the Green function’s technique and Landauer formalism. The system considered consists of electrode/ (ZGF)/electrode, in which the electrodes are chosen to be armchair nanoribbons. The study was performed for two types of ele...
In this paper we present a corner detection which makes use of eigenvalues of covariance matrices of different support regions over edge points. Edges are first extracted through the use of Canny edge detection, and then determine corners according to eigenvalues product of covariance matrices of the edge at various regions of support. Experimental results show that the proposed method has more...
let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
In this work, the optical absorption near the fundamental absorption edge of co-evaporated Ce0 -V20 films is studied. It is found that the fundamental optical absorption in these materials is sharp more like that expected for crystals. It is also found that as the V O content increases, the edge becomes less sharp and shifts towards higher wavelengths
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید