2957 search results - page 310 / 592 » The Complexity of Polynomial-Time Approximation |
161
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
158
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
209
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
222
click to vote
JMLR
2010
15 years 1 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
202
click to vote
SOCO
2010
Springer
15 years 1 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...