1749 search results - page 106 / 350 » Conditional colorings of graphs |
181
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
155
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
166
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
154
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
142
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...