102291 search results - page 20178 / 20459 » Computability in Computational Geometry |
168
click to vote
IVC
2006
15 years 6 months ago
2006
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
224
click to vote
JMLR
2008
15 years 6 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
209
click to vote
JMLR
2008
15 years 6 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
200
click to vote
JMLR
2008
15 years 6 months ago
2008
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
169
click to vote
CSDA
2007
15 years 6 months ago
2007
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...