We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
Witold Litwin, Riad Mokadem, Philippe Rigaux, Thom...
Growing up is in large measure learning about the world and our social and linguistic environment. We might call this data mining, although it is far more multimodal and immersive...
Abstract. We propose a framework for generating adaptive multimedia presentations through the dynamic selection of files from a large data repository. The presentation is generate...
Osama El Demerdash, Sabine Bergler, Leila Kosseim,...
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
We propose a designing method of Web application based on the new standard XML and on the dataweb notion. The content of the dataweb is obtained by an integration technique of het...