600 search results - page 28 / 120 » Problems and results in extremal combinatorics - II |
CPM
2004
Springer
14 years 1 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
ICPR
2000
IEEE
14 years 11 days ago
2000
IEEE
Vectorization, i.e. raster–to–vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one’s vectoriz...
AAAI
1994
13 years 9 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
CPM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
IJCAI
2003
13 years 9 months ago
2003
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...