318 search results - page 6 / 64 » A Robust Algorithm for Characterizing Anisotropic Local Stru... |
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Models of spatial variation in images are central to a large number of low-level computer vision problems including segmentation, registration, and 3D structure detection. Often, i...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
BMCBI
2006
13 years 7 months ago
2006
Background: The advent of genotype data from large-scale efforts that catalog the genetic variants of different populations have given rise to new avenues for multifactorial disea...