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

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

2014
Xuefeng Chen

A recently developed SHG microendoscope allows for in vivo imaging of sarcomeres, the basic contractile unit of muscle, in humans for the first time. The static images and dynamic line scans over time provide important information about muscle function and health. The goal of this project was to extract length from static images and dynamic timing properties from dynamic images as automatically...

Journal: :IEEE Trans. Geoscience and Remote Sensing 2014
Xudong Kang Shutao Li Jon Atli Benediktsson

The integration of spatial context in the classification of hyperspectral images is known to be an effective way in improving classification accuracy. In this paper, a novel spectralspatial classification framework based on edge-preserving filtering is proposed. The proposed framework consists of the following three steps. First, the hyper-spectral image is classified using a pixel-wise classif...

Journal: :Algebraic combinatorics 2022

We prove some Schur positivity results for the chromatic symmetric function X G of a (hyper)graph G, using connections to group algebra group. The first such connection works (hyper)forests F: we describe coefficients F in terms eigenvalues product Hermitian idempotents algebra, one factor each edge (a more general formula similar shape holds all chordal graphs). Our main application this techn...

Journal: :iranian journal of fuzzy systems 2008
l. torkzadeh m. abbasi m. m. zahedi zahedi

in this note we consider the notion of intuitionistic fuzzy (weak) dual hyper k-ideals and obtain related results. then we classify this notion according to level sets. after that we determine the relationships between intuitionistic fuzzy (weak) dual hyper k-ideals and intuitionistic fuzzy (weak) hyper k-ideals. finally, we define the notion of the product of two intuitionistic fuzzy (weak) du...

2011
A. KOSTOCHKA A. Kostochka

A hypergraph is color-critical if deleting any edge or vertex reduces the chromatic number; a color-critical hypergraph with chromatic number k is k-critical. Every k-chromatic hypergraph contains a k-critical hypergraph, so one can study chromatic number by studying the structure of k-critical (hyper)graphs. There is vast literature on k-critical graphs and hypergraphs. Many references can be ...

Journal: :Journal of Chemical Information and Computer Sciences 1997
Mircea V. Diudea

The problem of distances in a graph, G, is one of the most studied questions, both from theoretical point of view and applications (the reader can consult two recent reviews ). It is connected to the Wiener number, W, or "the path number" as denominated by its initiator. In acyclic structures, Wiener number and its extension, hyper-Wiener number, can be defined as edge/path contributions, Ie/p ...

Journal: :Journal of cell science 2005
David R Garrod Mohamed Y Berika William F Bardsley David Holmes Lydia Tabernero

The resistance of tissues to physical stress is dependent upon strong cell-cell adhesion in which desmosomes play a crucial role. We propose that desmosomes fulfil this function by adopting a more strongly adhesive state, hyper-adhesion, than other junctions. We show that the hyper-adhesive desmosomes in epidermis resist disruption by ethylene glycol bis(2-aminoethyl ether)-N,N,N'N'-tetraacetic...

2012
Sirous Moradi

Let G and H be graphs. The tensor product G⊗H of G and H has vertex set V (G ⊗ H) = V (G) × V (H) and edge set E(G ⊗ H) = {(a, b)(c, d)|ac ∈ E(G) and bd ∈ E(H)}. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of Kn ⊗G.

2004
R. D. Eyers

Multi temporal aerial photography and airborne hyper spectral imagery have been integrated for the detection and monitoring of coal mining subsidence hazards. Digital elevation models derived from successive epochs of aerial photography provide estimates of topographic change which may be indicative of the collapse of abandoned underground mine workings in the study area. Ground disturbed by su...

2014
Alina Ene Huy L. Nguyen

We consider the Hypergraph Multiway Partition problem (Hyper-MP). The input consists of an edge-weighted hypergraph G = (V, E) and k vertices s1, . . . , sk called terminals. A multiway partition of the hypergraph is a partition (or labeling) of the vertices of G into k sets A1, . . . , Ak such that si ∈ Ai for each i ∈ [k]. The cost of a multiway partition (A1, . . . , Ak) is ∑k i=1 w(δ(Ai)), ...

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

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