1298 search results - page 168 / 260 » The online set cover problem |
192
click to vote
3DOR
2010
15 years 1 months ago
2010
We introduce a new framework for the automatic selection of the best views of 3D models. The approach is based on the assumption that models belonging to the same class of shapes ...
168
click to vote
ICRA
2008
IEEE
16 years 27 days ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
216
click to vote
RTSS
1992
IEEE
15 years 10 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
182
click to vote
DM
2006
15 years 6 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
212
click to vote
ISMB
2000
15 years 7 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...