1161 search results - page 74 / 233 » Approximation schemes for clustering problems |
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
CJ
2010
15 years 13 min ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
P2P
2009
IEEE
15 years 6 months ago
2009
IEEE
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
102
click to vote
TIP
1998
14 years 11 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
104
click to vote
CCGRID
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Parallel file systems are designed to mask the everincreasing gap between CPU and disk speeds via parallel I/O processing. While they have become an indispensable compo...