BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
optim (3)
effici (2)
algorithm (2)
learn (2)
bound (2)

Stem minimax$ (all stems)

15 papers:

ICMLICML-2015-OsadchyHK #classification
K-hyperplane Hinge-Minimax Classifier (MO, TH, DK), pp. 1558–1566.
ICMLICML-2015-Suzuki #convergence
Convergence rate of Bayesian tensor estimator and its minimax optimality (TS), pp. 1273–1282.
ICMLICML-c1-2014-LuoS #learning #online #towards
Towards Minimax Online Learning with Unknown Time Horizon (HL, RES), pp. 226–234.
Aggregating Ordinal Labels from Crowds by Minimax Conditional Entropy (DZ, QL, JCP, CM), pp. 262–270.
MLDMMLDM-2014-UtkinZC #classification #data-driven #database #robust
A Robust One-Class Classification Model with Interval-Valued Data Based on Belief Functions and Minimax Strategy (LVU, YAZ, AIC), pp. 107–118.
Minimax option pricing meets black-scholes in the limit (JA, RMF, AW), pp. 1029–1040.
ICMLICML-2011-RobbianoC #learning #plugin #ranking
Minimax Learning Rates for Bipartite Ranking and Plug-in Rules (SR, SC), pp. 441–448.
PODSPODS-2010-GupteS #privacy
Universally optimal privacy mechanisms for minimax agents (MG, MS), pp. 135–146.
ICDARICDAR-2009-HeH09a #classification #estimation #online #using
Affine Distortion Compensation for an Isolated Online Handwritten Chinese Character Using Combined Orientation Estimation and HMM-Based Minimax Classification (TH, QH), pp. 1226–1230.
Efficiently computing minimax expected-size confidence regions (BB, HBM, CMS, JGS), pp. 97–104.
ICMLICML-2007-KimC #algorithm #geometry #message passing
Neighbor search with global geometry: a minimax message passing algorithm (KHK, SC), pp. 401–408.
HPCAHPCA-2002-UnsalKKM #energy #framework
The Minimax Cache: An Energy-Efficient Framework for Media Processors (OSÜ, IK, CMK, CAM), pp. 131–140.
STOCSTOC-2001-Tokuyama #multi #optimisation #parametricity #problem
Minimax parametric optimization problems and multi-dimensional parametric searching (TT), pp. 75–83.
STOCSTOC-1986-LeightonS #algorithm #analysis #bound #grid
Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
STOCSTOC-1981-PatersonRS #bound
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.