496 search results - page 77 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
STOC
2002
ACM
14 years 8 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. ...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
COLT
2000
Springer
14 years 7 hour ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...