393 search results - page 49 / 79 » The LCA Problem Revisited |
122
Voted
ESA
2009
Springer
15 years 6 months ago
2009
Springer
A familiar quandary arises when there are several possible alternatives for the solution of a problem, but no way of knowing which, if any, are viable for a particular problem inst...
123
click to vote
IEEEIAS
2009
IEEE
15 years 8 months ago
2009
IEEE
: This paper proposes a new watermarking method for detecting image tampering. First, an authentication number is created using a pair of watermark pixels as the coefficients of a ...
116
click to vote
CPM
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
128
Voted
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
106
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
We revisit the problem of recovering 3D shape from the projection of planar curves on a surface. This problem is strongly motivated by perception studies. Applications include sin...