Sciweavers

291 search results - page 31 / 59
» Approximate centerpoints with proofs
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
14 years 11 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 11 months ago
Average case analysis for batched disk scheduling and increasing subsequences
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. ...
Eitan Bachmat
CAIP
2005
Springer
107views Image Analysis» more  CAIP 2005»
14 years 4 months ago
Minimum-Length Polygons of First-Class Simple Cube-Curves
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
Fajie Li, Reinhard Klette
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
14 years 4 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan