Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
Antoine Bordes, Xavier Glorot, Jason Weston, Yoshu...
The majority of text retrieval and mining techniques are still based on exact feature (e.g. words) matching and unable to incorporate text semantics. Many researchers believe that...
Information retrieval systems (IRSs) usually suffer from a low ability to recognize a same idea that is expressed in different forms. A way of improving these systems is to take ...
Fabienne Moreau, Vincent Claveau, Pascale Sé...
Traditional face superresolution methods treat face images as 1D vectors and apply PCA on the set of these 1D vectors to learn the face subspace. Zhang et al [7] proposed Two-dire...