Sciweavers

490 search results - page 18 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
IACR
2011
141views more  IACR 2011»
13 years 9 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
LCN
2005
IEEE
15 years 3 months ago
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
John Risson, Ken Robinson, Tim Moors
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 7 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
ICRA
2010
IEEE
147views Robotics» more  ICRA 2010»
14 years 8 months ago
Towards One Shot Learning by imitation for humanoid robots
— Teaching a robot to learn new knowledge is a repetitive and tedious process. In order to accelerate the process, we propose a novel template-based approach for robot arm moveme...
Yan Wu, Yiannis Demiris
DCC
2002
IEEE
15 years 9 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar