Titlebook: SOFSEM 2001: Theory and Practice of Informatics; 28th Conference on C Leszek Pacholski,Peter Ru?i?ka Conference proceedings 2001 Springer-V

innovation

Conference proceedings 2001 well-known spa Pie?stany, Slovak Republic. This was the 28th annual conference in the SOFSEM series organized either in the Slovak or the Czech Republic. SOFSEM has a well-established tradition. Currently it is a broad, multid- ciplinary conference, devoted to the theory and practice of software sy

jettison

Negotiating the Semantic Gap: From Feature Maps to Semantic Landscapesword can then retrieve documents perhaps not containing this keyword, but containing other keywords from the same cluster. In this paper, we examine the use of this technique for content-based web document retrieval, using both keywords and image features to represent the documents.

anachronistic

How Can Computer Science Contribute to Knowledge Discoverylain some random sampling techniques for speeding up learning algorithms and making them applicable to large data sets [15], [16], [4], [3]. We also show some algorithms obtained by using these techniques.

Macronutrients

搜集

無(wú)政府主義者

Approximative Learning of Regular Languages of these language classes. Moreover, we show that all regular languages can be approximated in the setting introduced by Kobayashi and Yokomori [., [.]. Finally, we prove that the class of all function-distinguishable languages is equal to the class of regular languages.

征兵

The Potential of Grid, Virtual Laboratories and Virtual Organizations for Bio-sciencesand devices. In this paper, the general design of the VLAM-G platform is introduced. Furthermore, the application of the VLAM-G and its extension with Virtual Organization concepts for specific scientific domains is presented, with focus on bio-sciences.

賞錢(qián)

無(wú)底

Model Checking Communication Protocolstocols by verifying properties such as well-formedness and absence of deadlock. Our method is based on a representation of communicating finite-state machines in terms of logic programs. This leads to efficient verification algorithms based on the ground and non-ground semantics of logic programming.

神圣在玷污