2434 search results - page 139 / 487 » Algorithmic Randomness of Closed Sets |
172
Voted
ESA
2011
Springer
14 years 3 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
132
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
126
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
119
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
138
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...