417 search results - page 36 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
PODS
2000
ACM
14 years 26 days ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...