3643 search results - page 644 / 729 » Learning Submodular Functions |
125
Voted
GECCO
2006
Springer
15 years 6 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...
121
Voted
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
101
Voted
VLDB
2000
ACM
15 years 6 months ago
2000
ACM
This demonstration illustrates how a comprehensive database reconciliation tool can provide the ability to characterize data-quality and data-reconciliation issues in complex real...
130
Voted
ECCV
2010
Springer
15 years 6 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...
112
Voted
ICPR
2010
IEEE
15 years 5 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,...