1161 search results - page 44 / 233 » Approximation schemes for clustering problems |
82
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
76
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
88
Voted
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
HT
1996
ACM
15 years 1 months ago
1996
ACM
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...