1974 search results - page 107 / 395 » On Unbiased Linear Approximations |
185
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
94
Voted
SMI
2005
IEEE
15 years 6 months ago
2005
IEEE
A tight estimate on the maximum distance between a subdivision surface and its linear approximation is introduced to guide adaptive subdivision with guaranteed accuracy.
105
click to vote
TOC
2008
15 years 19 days ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
130
click to vote
SCIA
2009
Springer
15 years 7 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
77
Voted
ICDE
2010
IEEE
16 years 14 days ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...