1403 search results - page 19 / 281 » About Approximations of Exponentials |
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Due to their computational efficiency and strong empirical performance, semidefinite relaxation (SDR)–based algorithms have gained much attention in multiple–input multiple...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
COLT
2005
Springer
15 years 3 months 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...
AUSAI
2004
Springer
15 years 2 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
83
Voted
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...