495 search results - page 9 / 99 » Approximation algorithms for budgeted learning problems |
80
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
72
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
122
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
121
Voted
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
86
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...