5595 search results - page 782 / 1119 » Approximation Algorithms for Clustering Problems |
195
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
207
click to vote
PVLDB
2011
15 years 1 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
307
click to vote
TON
2010
15 years 1 months ago
2010
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
197
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
170
click to vote
COMPGEOM
2006
ACM
16 years 22 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...