10608 search results - page 545 / 2122 » Complexity of O'Hara's Algorithm |
137
click to vote
ICPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We propose an algorithm for texture segmentation based on a divide-and-conquerstrategy of statistical modeling.Selectedsets of Gaussianclusters,estimated via ExpectationMaximizati...
171
click to vote
TIME
2008
IEEE
16 years 1 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
175
click to vote
LSSC
2005
Springer
16 years 17 days ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
133
click to vote
ECAI
2004
Springer
16 years 14 days ago
2004
Springer
Abstract. Learning in complex contexts often requires pure induction to be supported by various kinds of meta-information. Providing such information is a critical, difficult and ...
188
Voted
KR
2004
Springer
16 years 13 days ago
2004
Springer
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...