1299 search results - page 8 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
66
Voted
TIP
2008
14 years 9 months ago
2008
Abstract--This paper considers the problem of high-dynamicrange (HDR) image capture using low-dynamic-range (LDR) cameras. We present three different minimal-bracketing algorithms ...
ICVS
2009
Springer
15 years 4 months ago
2009
Springer
Traditionally computer vision and pattern recognition algorithms are evaluated by measuring differences between final interpretations and ground truth. These black-box evaluations ...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
85
Voted
BMCBI
2005
14 years 9 months ago
2005
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
FOCS
2008
IEEE
14 years 10 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...