447 search results - page 68 / 90 » Approximation Algorithms for Directed Steiner Problems |
118
click to vote
PAMI
2010
14 years 11 months ago
2010
—This paper addresses the problem of robust template tracking in image sequences. Our work falls within the discriminative framework in which the observations at each frame yield...
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
150
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
143
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
124
click to vote
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...