3874 search results - page 275 / 775 » Approximation Algorithms for k-hurdle Problems |
130
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
134
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
195
click to vote
SIAMCOMP
2011
14 years 11 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
124
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
269
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...