搜索结果: 1-15 共查到“数学 the edge”相关记录32条 . 查询时间(0.165 秒)
Island-dynamics model for mound formation:Effect of a step-edge barrier
Island-dynamics model mound formation step-edge barrier
2015/10/16
We formulate and implement a generalized island-dynamics model of epitaxial growth based on the level-set technique to include the effect of an additional energy barrier for the attachment and detachm...
ASB/ISB award paper Manipulating the edge of instability
Feedback Motor control Time-delay Hand Biomechanics
2015/8/25
We investigate the integration of visual and tactile sensory input for dynamic manipulation. Our experimental data and computational
modeling reveal that time-delays are as critical to task-optimal m...
Topological finiteness for edge-vertex enumeration
Topological finiteness edge-vertex enumeration
2015/8/25
The number of PL-homeomorphism types of combinatorial manifolds in a fixed dimension with an upper bound on g2 is finite.
New Multiscale Transforms, Minimum Total Variation Synthesis: Applications to Edge-Preserving Image Reconstruction
Ridgelets curvelets wavelets pseudo-polar FFT Slant Stack Radon transform trigonometric interpolation total-variation edges edge-preserving tomography/deconvolution thresholding
2015/6/17
This paper describes newly invented multiscale transforms known under the name of the ridgelet [6] and the curvelet transforms [9, 8]. These systems combine ideas of multiscale analysis and geometry. ...
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
Combinatorics fault-tolerant analysis (n, k)-star graphs edge-connectivity h-super edge-connectivity
2012/4/18
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, and deter...
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number of edges in the rth p...
Edge-coloring series-parallel multigraphs
Edge-coloring series-parallel multigraphs Data Structures and Algorithms Combinatorics
2011/10/9
Abstract: We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colore...
On spanning maximum k-edge-colorable subgraphs
maximum k-edge-colorable subgraphs Discrete Mathematics
2011/10/9
Abstract: A subgraph $H$ of a graph $G$ is called spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is $k$-edge-colorable and contains as man...
Edge-Removal and Non-Crossing Perfect Matchings
Edge-Removal Non-Crossing Matchings Combinatorics Probability
2011/9/5
Abstract: We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing...
Minimal Reductions and Cores of Edge Ideals
edge ideal even cycles minimal reductions core
2011/2/28
We study minimal reductions of edge ideals of graphs containing a unique even cycle, and determine restrictions on the coefficients of the generators of these minimal reductions.
Edge ideals: algebraic and combinatorial properties
Edge ideal regularity associated prime sequentially Cohen-Macaulay
2011/2/25
Let C be a clutter and let I(C) R be its edge ideal. This is a survey paper on
the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regulari...
Given an edge ideal of graph G, we show that if the first nonlinear strand in the resolution of IG is zero until homological stage a1, then the next non-linear strand in the resolution is zero until h...
Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers)
Edge-Colouring Hypergraphs Properly Polychromatically
2010/12/15
Let the chromatic index of a hypergraph be the smallest number of colours needed to colour the
edges such that similarly-coloured edges are disjoint. Likewise, let the cover index be the maximum numb...