Sciweavers

513 search results - page 13 / 103
» Soft Edge Coloring
Sort
View
RSA
2008
78views more  RSA 2008»
14 years 12 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
ICCV
2003
IEEE
16 years 2 months ago
Color Edge Detection by Photometric Quasi-Invariants
Photometric invariance is used in many computer vision applications. The advantage of photometric invariance is the robustness against shadows, shading, and illumination condition...
Joost van de Weijer, Theo Gevers, Jan-Mark Geusebr...
83
Voted
DM
2000
103views more  DM 2000»
15 years 7 days ago
Feasible edge colorings of trees with cardinality constraints
A variation of preemptive open shop scheduling corresponds to
Dominique de Werra, Alain Hertz, Daniel Kobler, Na...
95
Voted
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
15 years 16 days ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
IV
2009
IEEE
124views Visualization» more  IV 2009»
15 years 7 months ago
A Coloring Solution to the Edge Crossing Problem
Radu Jianu, Adrian Rusu, Andrew J. Fabian, David H...