4843 search results - page 285 / 969 » The Shortcut Problem - Complexity and Approximation |
171
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
155
click to vote
AIMSA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
127
click to vote
WSC
2004
15 years 5 months ago
2004
Monte Carlo simulation techniques that use function approximations have been successfully applied to approximately price multi-dimensional American options. However, for many pric...
142
click to vote
SIAMSC
2008
15 years 3 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
146
click to vote
TSP
2008
15 years 3 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...