442 search results - page 19 / 89 » Regularization in oculomotor control |
MICRO
2000
IEEE
15 years 6 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
126
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
141
click to vote
PAMI
2012
13 years 4 months ago
2012
—It has been shown that the Universum data, which do not belong to either class of the classification problem of interest, may contain useful prior domain knowledge for training...
134
click to vote
ISPASS
2006
IEEE
15 years 8 months ago
2006
IEEE
Stride-based prefetching mechanisms exploit regular streams of memory accesses to hide memory latency. While these mechanisms are effective, they can be improved by studying the p...
92
Voted
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilisti...