4103 search results - page 196 / 821 » Some results on the Collatz problem |
138
click to vote
ICANNGA
2009
Springer
15 years 11 months ago
2009
Springer
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
173
click to vote
ICMLA
2008
15 years 8 months ago
2008
In this paper, we propose to use hypergraphs as the model for images and pose image segmentation as a machine learning problem in which some pixels (called seeds) are labeled as t...
170
click to vote
AMC
2008
15 years 6 months ago
2008
We study a non-overlapping domain decomposition method for the Oseen-viscoelastic flow problem. The data on the interface are transported through Newmann and Dirichlet boundary co...
177
Voted
TCS
2008
15 years 6 months ago
2008
A two-dimensional word is a function on Z2 with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditi...
158
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...