3250 search results - page 193 / 650 » Parameterized Learning Complexity |
195
click to vote
TPDS
2002
15 years 6 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
159
click to vote
IGPL
2010
15 years 5 months ago
2010
Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential...
293
click to vote
DISOPT
2011
15 years 1 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
216
click to vote
JMLR
2010
15 years 1 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
173
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we address invariant keypoint-based texture characterization and recognition. Viewing keypoint sets associated with visual textures as realizations of point process...