• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>11th International Conference on Conceptual Structures, ICCS 2003 Jul 21-25, 2003 Dresden, Germany >A Generic Scheme for the Design of Efficient On-Line Algorithms for Lattices
【24h】

A Generic Scheme for the Design of Efficient On-Line Algorithms for Lattices

机译：格的高效在线算法设计的通用方案

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A major issue with large dynamic datasets is the processing of small changes in the input through correspondingly small rearrangements of the output. This was the motivation behind the design of incremental or on-line algorithms for lattice maintenance, whose work amounts to a gradual construction of the final lattice by repeatedly adding rows/columns to the data table. As an attempt to put the incremental trend on strong theoretical grounds, we present a generic algorithmic scheme that is based on a detailed analysis of the lattice transformation triggered by a row/column addition and of the underlying sub-structure. For each task from the scheme we suggest an efficient implementation strategy and put a lower bound on its worst-case complexity. Moreover, an instanciation of the incremental scheme is presented which is as complex as the best batch algorithm.
机译：大型动态数据集的主要问题是通过相应地较小的输出重排来处理输入中的较小更改。这是设计增量或在线晶格维护算法的动机，该算法的工作相当于通过向数据表中反复添加行/列来逐步构建最终晶格。为了尝试将增量趋势作为有力的理论基础，我们提出了一种通用算法方案，该方案基于对行/列加法触发的晶格转换以及底层子结构的详细分析。对于该方案中的每个任务，我们建议一种有效的实施策略，并为其最坏情况的复杂性设置一个下限。此外，提出了增量方案的实例化，其与最佳批处理算法一样复杂。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号