2254 search results - page 143 / 451 » Computing the minimal covering set |
AFRIGRAPH
2004
ACM
15 years 6 months ago
2004
ACM
We present a technique for capturing the extreme dynamic range of natural illumination environments that include the sun and sky, which has presented a challenge for traditional h...
100
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Frames of videos with static background and dynamic foreground can be viewed as samples of signals that vary slowly in time with sparse corruption caused by foreground objects. We...
192
Voted
SADM
2011
14 years 8 months ago
2011
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
SAC
1997
ACM
15 years 5 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
105
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...