13987 search results - page 478 / 2798 » The Two Guards Problem |
177
click to vote
BMVC
2010
15 years 5 months ago
2010
It is well known that, due to illumination effects and the registration/alignment problem, it does not make sense to compare the "values" of two single-pixels for face r...
167
click to vote
CISC
2009
Springer
15 years 4 months ago
2009
Springer
In [10], Buchmann, Pyshkin and Weinmann have described two families of Feistel and SPN block ciphers called Flurry and Curry respectively. These two families of ciphers are fully p...
188
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
This paper addresses the problem of reconstructing the density of a scene from multiple projection images produced by modalities such as x-ray, electron microscopy, etc. where an ...
198
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
223
click to vote
SCIA
2009
Springer
16 years 1 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...