SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings
SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings
复制标题
SOFSEM 2006：计算机科学理论与实践，第 32 届计算机科学理论与实践当前趋势会议，捷克共和国梅林，2006 年 1 月 21-27 日，会议记录
DOI：
10.1007/11611257
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Julius Stuller
中科院分区：
文献类型：
--
作者：
J. Wiedermann;G. Tel;J. Pokorný;M. Bieliková;Julius Stuller
邀请的谈话。-大自然能否帮助我们计算？ - 不断发展的本体论演变。-对视觉网络包装器发电机的正式比较。-超越地平线：计划未来的欧洲ICT R＆D。-网络中的自私路由。-新的物理和超计算。 - 无线传感器网络的模型和算法（智能尘）。论文。-在图形中进行统治的一般数据减少方案。-XML视图维护的增量方法在非监视数据源的情况下进行维护。-非相互关联的复杂性。-构建具有矩形和正方形的匹配点。-搜索恒定带宽的路径。-图形搜索和搜索时间。-关于不一致的并发系统的推理：一种非经典的时间逻辑。用于排序斐波那契字符串旋转的算法。-定向着色：复杂性和近似值。-非块机：最小统治集合的参数化算法。-量子有限的自动机和逻辑。传感器网络中的范围查询。-罗马统治：参数化的视角。 SEDNA：一种本地XML DBM。-在单向环中匿名移动代理的最佳记忆集合。-知识制图 - 一种新的推理方法来描述逻辑本体。-使用可扩展的异依性数据库变形金刚的复杂性和精确算法。 - p选择性，免疫力和一个位的功率。-数据库的透明迁移服务。-在单个HOP无线电网络中合并和合并 - 在适当的最佳和高效合并中。-基于电子商务的个性化推荐系统。-用于XML数据库的有效索引方案。从有限自动机的多项式歧义。-可靠的广播无碰撞检测。-半施加静态型静态检查对象面向对象的查询语言。-构建一个模糊的转换系统。-通过数据库的模糊汇总生成新闻。-通过Web使用挖掘，Web内容挖掘和语义分析改进网站。-使用Javasymphony Middleware的顺序代码自动分发。关于UML改进模式的定义。-在隐式表示输入的问题上的复杂性。-真正需要多少点头部驱动图表解析？.-自动构建科学门户的本体学获取。-改进的岩石用于使用非对称接近性的文本聚类。-紧凑的编码Web分类法中所有本地路径信息的紧凑型编码。传感器网络。-关于某些图形群集测量的NP完整性。-移动代理的灵活策略体系结构。-改进的数字使用无信任系统权威的自我认证的公共钥匙进行消息恢复的签名。-小型独立边缘在最高学位的图中占主导地位。-最佳学生论文。
Invited Talks.- How Can Nature Help Us Compute?.- Evolving Ontology Evolution.- A Formal Comparison of Visual Web Wrapper Generators.- Beyond the Horizon: Planning Future European ICT R&D.- Selfish Routing in Networks.- New Physics and Hypercomputation.- Models and Algorithms for Wireless Sensor Networks (Smart Dust).- SomeWhere in the Semantic Web.- Mobility in Wireless Networks.- Group Communication: From Practice to Theory.- Regular Papers.- A General Data Reduction Scheme for Domination in Graphs.- Incremental Method for XML View Maintenance in Case of Non Monitored Data Sources.- Non-intersecting Complexity.- Constructing Interference-Minimal Networks.- Matching Points with Rectangles and Squares.- Searching Paths of Constant Bandwidth.- Graph Searching and Search Time.- Reasoning About Inconsistent Concurrent Systems: A Non-classical Temporal Logic.- Simple Algorithm for Sorting the Fibonacci String Rotations.- Oriented Coloring: Complexity and Approximation.- nonblocker: Parameterized Algorithmics for minimum dominating set.- Quantum Finite Automata and Logics.- FDSI-Tree: A Fully Distributed Spatial Index Tree for Efficient & Power-Aware Range Queries in Sensor Networks.- Roman Domination: A Parameterized Perspective.- Sedna: A Native XML DBMS.- Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.- The Knowledge Cartography - A New Approach to Reasoning over Description Logics Ontologies.- Complexity and Exact Algorithms for Multicut.- Using Extensible Heterogeneous Database Transformers.- P-Selectivity, Immunity, and the Power of One Bit.- Transparent Migration of Database Services.- Merging and Merge-Sort in a Single Hop Radio Network.- On Optimal and Efficient in Place Merging.- A Personalized Recommendation System Based on PRML for E-Commerce.- An Efficient Index Scheme for XML Databases.- On Separating Constant from Polynomial Ambiguity of Finite Automata.- Reliable Broadcasting Without Collision Detection.- Semi-strong Static Type Checking of Object-Oriented Query Languages.- Building a Fuzzy Transformation System.- News Generating Via Fuzzy Summarization of Databases.- Improving Web Sites with Web Usage Mining, Web Content Mining, and Semantic Analysis.- Automatic Distribution of Sequential Code Using JavaSymphony Middleware.- Unifying Framework for Message Passing.- Heuristics on the Definition of UML Refinement Patterns.- The Complexity of Problems on Implicitly Represented Inputs.- How Many Dots Are Really Needed for Head-Driven Chart Parsing?.- Ontology Acquisition for Automatic Building of Scientific Portals.- Improved ROCK for Text Clustering Using Asymmetric Proximity.- Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet.- Computational Complexity of Relay Placement in Sensor Networks.- On the NP-Completeness of Some Graph Cluster Measures.- A Flexible Policy Architecture for Mobile Agents.- An Improved Digital Signature with Message Recovery Using Self-certified Public Keys Without Trustworthy System Authority.- Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three.- The Best Student Paper.- Level-of-Detail in Behaviour of Virtual Humans.