1418 search results - page 69 / 284 » Schema polynomials and applications |
177
click to vote
ATAL
2005
Springer
15 years 11 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 ...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
142
click to vote
PAMI
2010
15 years 4 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
176
click to vote
IWOCA
2010
Springer
15 years 28 days ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
199
click to vote
JMLR
2010
15 years 28 days ago
2010
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...