5214 search results - page 188 / 1043 » The Online Specialization Problem |
123
click to vote
EMNLP
2007
15 years 5 months ago
2007
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
118
click to vote
NIPS
2008
15 years 5 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
120
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
122
click to vote
JCO
2006
15 years 4 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
158
click to vote
AROBOTS
2002
15 years 4 months ago
2002
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...