282 search results - page 32 / 57 » Online Learning of Approximate Dependency Parsing Algorithms |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper investigates multimedia quality fairness in wireless LAN environments where channel are error-prone due to mobility and fading. The experimental results show that using...
NIPS
1994
13 years 9 months ago
1994
A new learning algorithmis derived which performs online stochastic gradient ascent in the mutual informationbetween outputs and inputs of a network. In the absence of a priori kn...
NIPS
2008
13 years 9 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...