Sciweavers

263 search results - page 36 / 53
» Regret Bounds for Prediction Problems
Sort
View
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
14 years 1 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 4 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ECCV
2008
Springer
14 years 11 months ago
Learning to Localize Objects with Structured Output Regression
Sliding window classifiers are among the most successful and widely applied techniques for object localization. However, training is typically done in a way that is not specific to...
Matthew B. Blaschko, Christoph H. Lampert
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 10 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer