4843 search results - page 243 / 969 » The Shortcut Problem - Complexity and Approximation |
114
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
123
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
158
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
130
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
124
Voted
MOC
2002
15 years 3 months ago
2002
We study the dynamical behavior of the discontinuous Galerkin finite element method for initial value problems in ordinary differential equations. We make two different assumptions...