986 search results - page 99 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
128
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
133
Voted
JMLR
2010
14 years 10 months ago
2010
We introduce a variational inference framework for training the Gaussian process latent variable model and thus performing Bayesian nonlinear dimensionality reduction. This method...
123
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
133
Voted
SIROCCO
2004
15 years 5 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
143
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...