Sciweavers

393 search results - page 50 / 79
» The LCA Problem Revisited
Sort
View
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 8 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
100
Voted
ICPR
2000
IEEE
16 years 3 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. ...
106
Voted
STACS
2009
Springer
15 years 8 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
ICC
2009
IEEE
122views Communications» more  ICC 2009»
15 years 8 months ago
Using Area Hierarchy for Multi-Resolution Storage and Search in Large Wireless Sensor Networks
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
Konrad Iwanicki, Maarten van Steen
96
Voted
IRI
2008
IEEE
15 years 8 months ago
Modeling and synthesis of service composition using tree automata
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Ken Q. Pu, Ying Zhu