1977 search results - page 94 / 396 » The satisfactory partition problem |
172
click to vote
JCT
2010
15 years 4 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
139
click to vote
MSWIM
2006
ACM
16 years 2 days ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...
151
Voted
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
159
click to vote
IJIT
2004
15 years 7 months ago
2004
In the last decades, a number of robust fuzzy clustering algorithms have been proposed to partition data sets affected by noise and outliers. Robust fuzzy C-means (robust-FCM) is c...
182
Voted
DC
2006
15 years 6 months ago
2006
Group communication is the basic infrastructure for implementing fault-tolerant replicated servers. While group communication is well understood in the context of static systems (...