169 search results - page 17 / 34 » Bumptrees for Efficient Function, Constraint and Classificat... |
SIAMIS
2010
13 years 3 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
IAT
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--This paper describes an interactive tool for constrained clustering that helps users to select effective constraints efficiently during the constrained clustering process...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
IJCNN
2000
IEEE
14 years 5 days ago
2000
IEEE
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
KES
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...