Sciweavers

7150 search results - page 196 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
15 years 12 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
15 years 10 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
15 years 7 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 6 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
COMPGEOM
1993
ACM
15 years 10 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...