Sciweavers

379 search results - page 32 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 1 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
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 ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
EUROCRYPT
2004
Springer
14 years 1 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
CVPR
2007
IEEE
14 years 9 months ago
Shape from Planar Curves: A Linear Escape from Flatland
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...
Ady Ecker, Kiriakos N. Kutulakos, Allan D. Jepson
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
ICPR
2000
IEEE
14 years 8 months ago
Motion Estimation Using the Differential Epipolar Equation
We consider the motion estimation problem in the case of very closely spaced views. We revisit the differential epipolar equation providing an interpretation of it. On the basis o...
Luis Baumela, Lourdes de Agapito, Ian D. Reid, P. ...