Sciweavers

389 search results - page 6 / 78
» Some natural decision problems in automatic graphs
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Image segmentation towards natural clusters
To find how many clusters in a sample set is an old yet unsolved problem in unsupervised clustering. Many segmentation methods require the user to specify the number of regions in...
Zhigang Tan, Nelson Hon Ching Yung
GECCO
2009
Springer
13 years 12 months ago
Using simulated annealing for producing software architectures
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...
Outi Räihä, Erkki Mäkinen, Timo Por...
EMMCVPR
2007
Springer
14 years 1 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
IJFCS
2007
93views more  IJFCS 2007»
13 years 7 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...