Sciweavers

4903 search results - page 318 / 981
» The Set Covering Machine
Sort
View
COLT
2007
Springer
16 years 29 days ago
Generalised Entropy and Asymptotic Complexities of Languages
Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
FOSSACS
2007
Springer
16 years 29 days ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz
MLG
2007
Springer
16 years 28 days ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
ICALT
2006
IEEE
16 years 25 days ago
Effective Analysis and Design of Computer-Supported Learning System
The analysis phase constitutes an essential step in the development of information systems. Nevertheless, learning materials design activities currently have reduced the analysis ...
David Díez Cebollero, Camino Fernánd...
ICALT
2005
IEEE
16 years 12 days ago
Intelligent Visual Reasoning Tutor
Visual reasoning is an essential skill for many disciplines in engineering and architecture. We describe an intelligent tutoring system for visual reasoning that uses the missing ...
Eric Wang, Yong Se Kim