Sciweavers

1951 search results - page 127 / 391
» An algorithm for improving graph partitions
Sort
View
CEC
2005
IEEE
15 years 10 months ago
Improvements to the scalability of multiobjective clustering
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
Julia Handl, Joshua D. Knowles
ICDCS
2002
IEEE
15 years 9 months ago
From Total Order to Database Replication
This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknow...
Yair Amir, Ciprian Tutu
IJHIS
2007
89views more  IJHIS 2007»
15 years 4 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
VIP
2001
15 years 5 months ago
Three-dimensional Medical Image Segmentation Using a Graph-Theoretic Energy-Minimisation Approach
A new graph algorithm for multiscale segmentation of threedimensional medical data sets is presented. It is a threedimensional generalisation of an existing two-dimensional Mumfor...
Brian Parker
TIT
1998
79views more  TIT 1998»
15 years 4 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård