Sciweavers

12836 search results - page 514 / 2568
» Generalization Methods in Bioinformatics
Sort
View
243
Voted
CVPR
2009
IEEE
17 years 2 months ago
Fast Multiple Shape Correspondence by Pre-Organizing Shape Instances
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In general, shapecorrespondenc...
Andrew Temlyakov, Brent C. Munsell, Song Wang
CIARP
2006
Springer
15 years 11 months ago
Feature Selection Based on Mutual Correlation
Feature selection is a critical procedure in many pattern recognition applications. There are two distinct mechanisms for feature selection namely the wrapper methods and the filte...
Michal Haindl, Petr Somol, Dimitrios Ververidis, C...
221
Voted
ILP
1997
Springer
15 years 11 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 11 months ago
A unified optimization framework for microelectronics industry
In this paper, an object-oriented unified optimization framework (UOF) for general problem optimization is proposed. Based on evolutionary algorithms, numerical deterministic meth...
Yiming Li, Cheng-Kai Chen, Yen-Yu Cho
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry