Sciweavers

2190 search results - page 266 / 438
» Learning with the Set Covering Machine
Sort
View
COLT
2010
Springer
13 years 7 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
13 years 1 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
ML
2006
ACM
103views Machine Learning» more  ML 2006»
14 years 3 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
BMCBI
2010
193views more  BMCBI 2010»
13 years 4 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt
PKDD
2005
Springer
109views Data Mining» more  PKDD 2005»
14 years 2 months ago
An Imbalanced Data Rule Learner
Imbalanced data learning has recently begun to receive much attention from research and industrial communities as traditional machine learners no longer give satisfactory results. ...
Canh Hao Nguyen, Tu Bao Ho