2569 search results - page 107 / 514 » Approximate Objects and Approximate Theories |
274
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
183
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial ob...
167
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
The aim of this paper is to study an Information Theory based learning theory for neural units endowed with adaptive activation functions. The learning theory has the target to fo...
161
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
161
click to vote
IJON
2007
15 years 6 months ago
2007
In this paper, a ridgelet kernel regression model is proposed for approximation of high dimensional functions. It is based on ridgelet theory, kernel and regularization technology ...