752 search results - page 80 / 151 » Faster approximation algorithms for the minimum latency prob... |
121
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
129
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
122
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
105
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
137
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...