The number of research topics covered in recent approaches to Information Extraction (IE) is continually growing as new facts are being considered. In fact, while the user’s interest in extracting information from texts deals mainly with the success of the entire process of locating, in document collections, facts of interest,...

It was a real pleasure to have taken part in organizing the 10th International Conference on Cryptography and Network Security (CANS 2011). It was held during December 10–12, 2011, at the International Asia Pacific Convention Center in Sanya, on the subtropical island of Hainan (China). CANS 2011 was sponsored by the National...

Thinking in terms of facts and rules is perhaps one of the most common ways of approaching problem definition and problem solving both in everyday life and under more formal circumstances. The best known set of rules, the Ten Commandments have been accompanying us since the times of Moses; the Decalogue proved to be simple but...

Artificial Intelligence's long-term goal is to build the human level of artificial intelligence. AI was born 50 years ago, in the bumpy road has made encouraging progress, in particular, machine learning, data mining, computer vision, expert systems, natural language processing, planning, robotics and related applications have...

Data mining and knowledge discovery can today be considered as stable fields with numerous efficient methods and studies that have been proposed to extract knowledge from data. Nevertheless, the famous golden nugget is still challenging. Actually, the context evolved since the first definition of the KDD process and knowledge has now...

The 10th International Conference on Intelligent Tutoring Systems, ITS 2010, continued the bi-annual series of top-flight international conferences on the use of advanced educational technologies that are adaptive to users or groups of users. These highly interdisciplinary conferences bring together researchers in the learning sciences,...

For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....

The 10th International Conference on Intelligent Tutoring Systems, ITS 2010, continued the bi-annual series of top-flight international conferences on the use of advanced educational technologies that are adaptive to users or groups of users. These highly interdisciplinary conferences bring together researchers in the learning sciences,...