Sciweavers

576 search results - page 4 / 116
» Matching methodology to problem domain
Sort
View
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 2 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
EMMCVPR
2001
Springer
14 years 1 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
APPML
2008
77views more  APPML 2008»
13 years 8 months ago
A controllability approach to shape identification
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...
Robert Azencott, Roland Glowinski, A. M. Ramos
ECIS
2000
13 years 10 months ago
A Proposed Methodology for Web Development
The aim of this paper is to examine the domain of World Wide Web site development and propose a methodology to assist with this process. Methodologies have both their proselytizers...
Debra Howcroft, John A. Carroll