We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
In this paper we compared the performance of the Automatic Data Reduction System (ADRS) and principal component analysis (PCA) as a preprocessor to artificial neural networks (ANN...
Nicholas Navaroli, David Turner, Arturo I. Concepc...
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
In this paper, we show how a user profile can be enhanced when a more detailed description of the products is included. Two main assumptions have been considered: the first implie...
Juan F. Huete, Luis M. de Campos, Juan M. Fern&aac...