6045 search results - page 363 / 1209 » Computable Linearizations of Well-partial-orderings |
180
click to vote
IJCAI
2001
15 years 9 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
253
click to vote
NIPS
2004
15 years 9 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
153
click to vote
SIROCCO
2003
15 years 9 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
184
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
175
click to vote
PAMI
2006
15 years 7 months ago
2006
In an errors-in-variables (EIV) model, all the measurements are corrupted by noise. The class of EIV models with constraints separable into the product of two nonlinear functions, ...