5595 search results - page 156 / 1119 » Approximation Algorithms for Clustering Problems |
138
Voted
JMLR
2006
15 years 5 months ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
155
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we ...
161
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
129
Voted
BC
2005
15 years 4 months ago
2005
Motion repulsion is the perceived enlargement of the angle between the directions of motion of two transparently moving patterns. An explanation of this illusion has long been soug...
155
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...