526 search results - page 38 / 106 » Increments of Random Partitions |
ICALP
2011
Springer
12 years 12 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
ICML
2000
IEEE
14 years 9 months ago
2000
IEEE
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
PARA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
DAM
2007
13 years 8 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
IJHIS
2007
13 years 8 months ago
2007
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...