1952 search results - page 243 / 391 » Complete partitions of graphs |
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
162
click to vote
IWSOS
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents an optimization framework for finding efficient deployment mappings of replicated service components (to nodes), while accounting for multiple services simult...
152
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
148
click to vote
PCM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper proposes an online segmentation scheme for broadcasted American football TV programs. The TV video streams are online partitioned into a series of play-break p...
209
click to vote
SCALESPACE
2001
Springer
15 years 11 months ago
2001
Springer
Bayesian statistical theory is a convenient way of taking a priori information into consideration when inference is made from images. In Bayesian image detection, the a priori dist...