Results 241 to 250 of about 92,019 (279)
Some of the next articles are maybe not open access.
ACM Transactions on Graphics, 2011
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Color perception is recognized to vary with surrounding spatial structure, but the impact of edge smoothness on color has not been studied in color appearance modeling. In this work, we study the appearance of color under different degrees of edge smoothness.
Kim, M. H. Kim, Min Hyuk +2 more
openaire +3 more sources
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
Journal of Algorithms, 1996
Summary: Many combinatorial problems can be efficiently solved for partial \(k\)-trees (graphs of treewidth bounded by \(k\)). The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity.
Zhou, Xiao +2 more
openaire +2 more sources
Summary: Many combinatorial problems can be efficiently solved for partial \(k\)-trees (graphs of treewidth bounded by \(k\)). The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity.
Zhou, Xiao +2 more
openaire +2 more sources
Optimal edge‐coloring with edge rate constraints
Networks, 2013We consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that ...
Dereniowski, Dariusz +3 more
openaire +2 more sources
Pattern Recognition Letters, 1985
The detection of visually significant edges and boundaries in a natural color image is complicated by inherent noise and correlation between color coordinates. In this letter we present a color edge detector which uses fuzzy set theory to model this imprecision.
T.L Huntsberger, M.F Descalzi
openaire +1 more source
The detection of visually significant edges and boundaries in a natural color image is complicated by inherent noise and correlation between color coordinates. In this letter we present a color edge detector which uses fuzzy set theory to model this imprecision.
T.L Huntsberger, M.F Descalzi
openaire +1 more source
Edge Coloring Series Parallel Graphs
Journal of Algorithms, 1995Abstract We present an algorithm for optimally edge coloring series parallel graphs. We give a linear time implementation, as well as a parallel implementation, of the algorithm that runs in O (log 3 n ) time using O ( n ) processors. The sequential implementation, which is optimal, improves the best-known algorithm. The parallel implementation of
Caspi, Yuval, Dekel, Eliezer
openaire +1 more source
2000
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Konstantinos N. Plataniotis +1 more
openaire +1 more source
One of the fundamental tasks in image processing is edge detection. High level image processing, such as object recognition, segmentation, image coding, and robot vision, depend on the accuracy of edge detection. Edges contain essential information about an image. Most edge detection techniques are based on finding maxima in the first derivative of the
Konstantinos N. Plataniotis +1 more
openaire +1 more source
2007
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
1995
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
Graph Edge Coloring and Extensions of Edge Colorings
This dissertation explores two main questions which may be framed in terms of graph edge-coloring. First, an assignment of $k$ colors to the edges of the complete bipartite graph $K_{n,n}$ corresponds to an assignment of $k$ symbols to the cells of an $n\times n$ array.openaire +1 more source