找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 指责
发表于 2025-3-23 13:17:39 | 显示全部楼层
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
发表于 2025-3-23 16:23:37 | 显示全部楼层
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.
发表于 2025-3-23 19:08:15 | 显示全部楼层
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.
发表于 2025-3-23 22:46:43 | 显示全部楼层
发表于 2025-3-24 03:39:29 | 显示全部楼层
发表于 2025-3-24 07:12:28 | 显示全部楼层
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.
发表于 2025-3-24 12:28:33 | 显示全部楼层
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.
发表于 2025-3-24 17:12:01 | 显示全部楼层
发表于 2025-3-24 19:10:09 | 显示全部楼层
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.
发表于 2025-3-25 03:05:45 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 01:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表