98 search results - page 7 / 20 » Bounding Recursive Procedural Models Using Convex Optimizati... |
CIMAGING
2010
13 years 8 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
NIPS
2001
13 years 8 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this work we propose a scanline optimization procedure for computational stereo using a linear smoothness cost model performed by programmable graphics hardware. The main idea ...