Sciweavers

1763 search results - page 300 / 353
» A Formalization of Polytime Functions
Sort
View
IJNSEC
2008
106views more  IJNSEC 2008»
14 years 9 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
IGPL
2006
90views more  IGPL 2006»
14 years 9 months ago
Surviving Abduction
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
Walter Alexandre Carnielli
IS
2008
14 years 9 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
IJON
2006
131views more  IJON 2006»
14 years 9 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
JCP
2008
139views more  JCP 2008»
14 years 9 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang