2527 search results - page 61 / 506 » Discrete optimization in computer vision |
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
82
Voted
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
XCS with Computed Action, briefly XCSCA, is a recent extension of XCS to tackle problems involving a large number of discrete actions. In XCSCA the classifier action is computed wi...
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a fe...
113
Voted
AAIM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
82
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...