Sciweavers

2715 search results - page 195 / 543
» Total Generalized Variation
Sort
View
132
Voted
ICIP
2009
IEEE
16 years 4 months ago
Segmentation On Surfaces With The Closest Point Method
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 9 months ago
An extended mutation concept for the local selection based differential evolution algorithm
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Jani Rönkkönen, Jouni Lampinen
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 9 months ago
XCS for robust automatic target recognition
A primary strength of the XCS approach is its ability to create maximally accurate general rules. In automatic target recognition (ATR) there is a need for robust performance beyo...
B. Ravichandran, Avinash Gandhe, Robert E. Smith
163
Voted
PLPV
2009
ACM
16 years 10 days ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
99
Voted
WINE
2009
Springer
138views Economy» more  WINE 2009»
15 years 10 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing