4843 search results - page 154 / 969 » The Shortcut Problem - Complexity and Approximation |
111
click to vote
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
124
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
114
click to vote
NIPS
2007
15 years 4 months ago
2007
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
121
click to vote
MP
2002
15 years 2 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
117
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...