Sciweavers

5 search results - page 1 / 1
» Global Search Based on Efficient Diagonal Partitions and a s...
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 10 days ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
TSMC
2008
189views more  TSMC 2008»
13 years 5 months ago
Automatic Clustering Using an Improved Differential Evolution Algorithm
Differential evolution (DE) has emerged as one of the fast, robust, and efficient global search heuristics of current interest. This paper describes an application of DE to the aut...
Swagatam Das, Ajith Abraham, Amit Konar
CVPR
2006
IEEE
14 years 7 months ago
A Projective Invariant for Textures
Image texture analysis has received a lot of attention in the past years. Researchers have developed many texture signatures based on texture measurements, for the purpose of uniq...
Cornelia Fermüller, Hui Ji, Yong Xu
FLAIRS
2004
13 years 6 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia
ITSL
2008
13 years 6 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki