1920 search results - page 71 / 384 » The Complexity of the A B C Problem |
176
click to vote
HIPEAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
147
click to vote
CVPR
1997
IEEE
15 years 10 months ago
1997
IEEE
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
190
click to vote
MMAS
2010
Springer
15 years 26 days ago
2010
Springer
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
167
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
171
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index ha...