Sciweavers

999 search results - page 83 / 200
» On the Decidability of Functional Uncertainty
Sort
View
CSFW
2007
IEEE
14 years 4 months ago
A Formal Theory of Key Conjuring
Key conjuring is the process by which an attacker obtains an unknown, encrypted key by repeatedly calling a cryptographic API function with random values in place of keys. We prop...
Véronique Cortier, Stéphanie Delaune...
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
14 years 4 months ago
Design of Classifier to Automate the Evaluation of Protein Crystallization States
– This paper presents a method for designing classifier to automate an evaluation process of protein crystallization growth states. The classifier is designed by binary decision ...
Kanako Saitoh, Kuniaki Kawabata, Hajime Asama, Tak...
ECAL
2005
Springer
14 years 3 months ago
Evolving Neural Mechanisms for an Iterated Discrimination Task: A Robot Based Model
This paper is about the design of an artificial neural network to control an autonomous robot that is required to iteratively solve a discrimination task based on time-dependent s...
Elio Tuci, Christos Ampatzis, Marco Dorigo
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
FSTTCS
2001
Springer
14 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari