4047 search results - page 173 / 810 » The Discrete Basis Problem |
119
click to vote
JMLR
2006
15 years 1 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
141
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences....
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
112
click to vote
CCE
2004
15 years 1 months ago
2004
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
103
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...