5595 search results - page 467 / 1119 » Approximation Algorithms for Clustering Problems |
209
click to vote
PAMI
2011
15 years 2 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
228
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
199
click to vote
SIGCOMM
1999
ACM
15 years 12 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
229
click to vote
SOSP
2009
ACM
16 years 4 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
173
click to vote
STOC
2007
ACM
16 years 8 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...