472 search results - page 21 / 95 » Linear programming with online learning |
ACSC
2005
IEEE
13 years 9 months ago
2005
IEEE
Gradiance On-Line Accelerated Learning GOAL is a system for creating and automatically grading homeworks, programming laboratories, and tests. Through the concept of root questi...
JMLR
2008
13 years 7 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
RSS
2007
13 years 9 months ago
2007
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...