663 search results - page 71 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
CVPR
2009
IEEE
14 years 12 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
EMSOFT
2004
Springer
14 years 1 months ago
2004
Springer
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...