—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...