4171 search results - page 508 / 835 » Choice numbers of graphs |
149
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
217
click to vote
CVPR
2010
IEEE
16 years 28 days ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
178
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
162
click to vote
SOFSEM
2007
Springer
16 years 26 days ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
190
click to vote
CPM
2005
Springer
16 years 9 days ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...