952 search results - page 53 / 191 » Computational complexity of stochastic programming problems |
118
Voted
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
116
click to vote
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We address in this paper the problem of segmenting complex handritten pages such as novelist drafts or authorial manuscripts. We propose to use stochastic and contextual models in...
106
click to vote
AGI
2008
15 years 1 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
105
Voted
ECAI
1992
Springer
15 years 4 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
126
click to vote
JMLR
2010
14 years 7 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...