Sciweavers

1749 search results - page 163 / 350
» Conditional colorings of graphs
Sort
View
DAM
1998
75views more  DAM 1998»
15 years 6 months ago
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
Jørgen Bang-Jensen, Gregory Gutin, Anders Y...
DM
2007
97views more  DM 2007»
15 years 6 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
IJCV
2002
185views more  IJCV 2002»
15 years 6 months ago
Vision and the Atmosphere
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
Srinivasa G. Narasimhan, Shree K. Nayar
CVPR
2008
IEEE
16 years 11 months ago
Illumination and Camera Invariant Stereo Matching
Color information can be used as a basic and crucial cue for finding correspondence in a stereo matching algorithm. In a real scene, however, image colors are affected by various g...
Yong Seok Heo (Seoul National University), Kyoung ...
VLC
2008
132views more  VLC 2008»
15 years 6 months ago
Enforced generative patterns for the specification of the syntax and semantics of visual languages
We present the new notion of enforced generative pattern, a structure that declares positive or negative conditions that must be satisfied by a model. Patterns are applied to tran...
Paolo Bottoni, Esther Guerra, Juan de Lara