10054 search results - page 1604 / 2011 » On the Complexity of Function Learning |
209
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
216
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
201
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
—A novel non-linear dimensionality reduction method, called Temporal Laplacian Eigenmaps, is introduced to process efficiently time series data. In this embedded-based approach,...
206
click to vote
CPAIOR
2006
Springer
15 years 9 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
229
click to vote
DEXA
2008
Springer
2008
Springer
Evolutionary Clustering in Description Logics: Controlling Concept Formation and Drift in Ontologies
15 years 9 months ago
Abstract. We present a method based on clustering techniques to detect concept drift or novelty in a knowledge base expressed in Description Logics. The method exploits an effectiv...