Sciweavers

925 search results - page 4 / 185
» A Solution to the Extended GCD Problem
Sort
View
ASIACRYPT
2009
Springer
14 years 10 days ago
PSS Is Secure against Random Fault Attacks
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
Jean-Sébastien Coron, Avradip Mandal
ENTCS
2006
118views more  ENTCS 2006»
13 years 7 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
AAAI
2004
13 years 9 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
ICRA
2009
IEEE
133views Robotics» more  ICRA 2009»
14 years 2 months ago
A stochastically stable solution to the problem of robocentric mapping
Abstract— This paper provides a novel solution for robocentric mapping using an autonomous mobile robot. The robot dynamic model is the standard unicycle model and the robot is a...
Adrian N. Bishop, Patric Jensfelt
NECO
2008
116views more  NECO 2008»
13 years 7 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed