We prove logarithmic regret bounds that depend on the loss Lā T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciļ...
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Our research aims at interactive document viewers that can select and highlight relevant text passages on demand. Another related objective is the generation of topic-speciļ¬c su...
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...