3049 search results - page 289 / 610 » On the Convergence of Bound Optimization Algorithms |
202
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To...
171
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
201
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
169
click to vote
COLT
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
163
click to vote
ESA
2004
Springer
16 years 19 hour ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...