654 search results - page 118 / 131 » On the Approximation of Computing Evolutionary Trees |
118
Voted
FOCS
1997
IEEE
15 years 1 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
101
click to vote
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
101
Voted
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
118
click to vote
PPOPP
2011
ACM
14 years 15 days ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
72
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...