67 search results - page 14 / 14 » A branch-and-cut algorithm for partition coloring |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
VISUALIZATION
1996
IEEE
13 years 9 months ago
1996
IEEE
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...