Sciweavers

828 search results - page 61 / 166
» Bounded Hairpin Completion
Sort
View
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 8 months ago
Guaranteed navigation with an unreliable blind robot
— We consider a navigation problem for a robot equipped with only a map, compass, and contact sensor. In addition to the limitations placed on sensing, we assume that there exist...
Jeremy S. Lewis, Jason M. O'Kane
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 10 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
IACR
2011
155views more  IACR 2011»
12 years 9 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
CVPR
2001
IEEE
15 years 4 days ago
Tracking and Modeling Non-Rigid Objects with Rank Constraints
This paper presents a novel solution for flow-based tracking and 3D reconstruction of deforming objects in monocular image sequences. A non-rigid 3D object undergoing rotation and...
Lorenzo Torresani, Danny B. Yang, Eugene J. Alexan...
CP
2006
Springer
14 years 1 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...