4114 search results - page 31 / 823 » Efficient Algorithms for the 2-Center Problems |
132
click to vote
PAMI
2010
15 years 2 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
163
click to vote
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
111
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
182
click to vote
TAINN
2005
Springer
15 years 9 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
214
click to vote
IJIT
2004
15 years 5 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...