咨询与建议

限定检索结果

文献类型

  • 5 篇 会议
  • 3 篇 期刊文献

馆藏范围

  • 8 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 5 篇 计算机科学与技术...
    • 2 篇 电气工程
    • 2 篇 信息与通信工程
    • 1 篇 仪器科学与技术
    • 1 篇 软件工程
  • 1 篇 理学
    • 1 篇 生物学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 8 篇 bottom-up algori...
  • 1 篇 legacy system re...
  • 1 篇 parallel iterati...
  • 1 篇 dynamic terrain
  • 1 篇 performance
  • 1 篇 query processing
  • 1 篇 singularity anal...
  • 1 篇 piecewise linear...
  • 1 篇 graph theoretica...
  • 1 篇 generating funct...
  • 1 篇 computational co...
  • 1 篇 trees (mathemati...
  • 1 篇 optimal executio...
  • 1 篇 automatic genera...
  • 1 篇 optimization
  • 1 篇 cyclic query gra...
  • 1 篇 steady-state int...
  • 1 篇 tree data struct...
  • 1 篇 compactness prin...
  • 1 篇 graph theory

机构

  • 1 篇 zhejiang univ co...
  • 1 篇 univ tehran inst...
  • 1 篇 shandong univers...
  • 1 篇 shahid beheshti ...
  • 1 篇 univ tehran sch ...
  • 1 篇 univ politecn ma...
  • 1 篇 inst res fundame...
  • 1 篇 univ complutense...
  • 1 篇 chinese acad sci...
  • 1 篇 peking universit...
  • 1 篇 univ mannheim da...
  • 1 篇 dept. of compute...
  • 1 篇 shandong univ sc...
  • 1 篇 natl inst genet ...
  • 1 篇 state st technol...

作者

  • 1 篇 zhang chao
  • 1 篇 sadeghi mehdi
  • 1 篇 xiaodong wang
  • 1 篇 cao pengfei
  • 1 篇 liao mingxue
  • 1 篇 he xiaoxin
  • 1 篇 wu di
  • 1 篇 ansari elnaz sab...
  • 1 篇 qingming tang
  • 1 篇 wang jiandong
  • 1 篇 pezeshk hamid
  • 1 篇 jiandong wang
  • 1 篇 yan yu
  • 1 篇 yingjie wu
  • 1 篇 eslahchi changiz
  • 1 篇 fernández-camach...
  • 1 篇 fender pit
  • 1 篇 xu fanjang
  • 1 篇 sánchez-couso jr
  • 1 篇 su xing

语言

  • 8 篇 英文
检索条件"主题词=bottom-up algorithm"
8 条 记 录,以下是1-10 订阅
排序:
Piecewise linear representations of time series using improved bottom-up algorithm
Piecewise linear representations of time series using improv...
收藏 引用
第28届中国过程控制会议(CPCC 2017)暨纪念中国过程控制会议30周年
作者: Yan Yu Jiandong Wang Peking University Shandong University of Science and Technology
This paper proposes a new algorithm,named as the improved bottom-up algorithm,to approximate time series in a linear *** algorithm starts by the finest possible approximation of time series,so that n-1 segments are us... 详细信息
来源: 评论
Reductions in binary search trees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第3期355卷 327-353页
作者: Sánchez-Couso, JR Fernández-Camacho, MI Univ Complutense Dept Sistemas Informat & Programac Fac CC Matemat E-28040 Madrid Spain Univ Politecn Madrid Dept Lenguajes Proyectos & Sistemas Informat Esc Univ Informat Madrid 28031 Spain
We analyze two bottom-up reduction algorithms over binary trees that represent replaceable data within a certain system, assuming the binary search tree (BST) probabilistic model. These reductions are based on idempot... 详细信息
来源: 评论
ProDomAs, protein domain assignment algorithm using center-based clustering and independent dominating set
收藏 引用
PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS 2014年 第9期82卷 1937-1946页
作者: Ansari, Elnaz Saberi Eslahchi, Changiz Pezeshk, Hamid Sadeghi, Mehdi Univ Tehran Inst Biochem & Biophys Dept Bioinformat Tehran Iran Shahid Beheshti Univ Dept Comp Sci GC Tehran Iran Inst Res Fundamental Sci IPM Sch Biol Sci Tehran Iran Univ Tehran Sch Math Stat & Comp Sci Coll Sci Tehran Iran Natl Inst Genet Engn & Biotechnol Tehran Iran
Decomposition of structural domains is and essential task in classifying protein structures, predicting protein function, and many other proteomics problems. As the number of known protein structures in PDB grows expo... 详细信息
来源: 评论
Parallel Iterative Reengineering Model of Legacy Systems
Parallel Iterative Reengineering Model of Legacy Systems
收藏 引用
IEEE International Conference on Systems, Man and Cybernetics
作者: Su, Xing Yang, Xiaohu Li, Juefeng Wu, Di Zhejiang Univ Coll Comp Sci Hangzhou 310027 Peoples R China State St Technol Zhejiang Hangzhou Zhejiang Peoples R China
Great improvements have been made in methodologies on reengineering of legacy systems to enhance the migration process. Unfortunately, taking into account the large scale of these systems, the duration of reengineerin... 详细信息
来源: 评论
A New, Highly Efficient, and Easy To Implement Top-Down Join Enumeration algorithm
A New, Highly Efficient, and Easy To Implement Top-Down Join...
收藏 引用
IEEE 27th International Conference on Data Engineering (ICDE 2011)
作者: Fender, Pit Moerkotte, Guido Univ Mannheim Database Res Grp D-68131 Mannheim Germany
Finding an optimal execution order of join operations is a crucial task in every cost-based query optimizer. Since there are many possible join trees for a given query, the overhead of the join (tree) enumeration algo... 详细信息
来源: 评论
IMPROVEMENT ON DYNAMIC TILED TERRAIN RENDERING algorithm IN LIBMINI
IMPROVEMENT ON DYNAMIC TILED TERRAIN RENDERING ALGORITHM IN ...
收藏 引用
22nd European Modeling and Simulation Symposium (EMSS)
作者: Liao Mingxue Xu Fanjang He Xiaoxin Chinese Acad Sci Inst Software Beijing Peoples R China
As an open source library for large-scale terrain rendering in a continuous LOD high field, libMini takes a top-down method for static terrain rendering and achieves good perfounance. However, it uses the same top-dow... 详细信息
来源: 评论
Steady-State Interval Detection and Nonlinear Modeling for Automatic Generation Control Systems
收藏 引用
IEEE ACCESS 2019年 7卷 139592-139600页
作者: Cao, Pengfei Wang, Jiandong Zhang, Chao Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Shandong Peoples R China
Automatic generation control systems are designed to adjust electric power outputs of multiple generators simultaneously in accordance with the current load. However, the control instruction and the main steam pressur... 详细信息
来源: 评论
Optimal Hierarchical Partition for k-Anonymity
Optimal Hierarchical Partition for k-Anonymity
收藏 引用
The 5th International Conference on Computer Science & Education(第五届国际计算机新技术与教育学术研讨会 ICCSE'10)
作者: Qingming Tang Yingjie Wu Xiaodong Wang Dept. of Computer Science FuZhou University FuZhou FuJianChina350108
k-Anonymity is a famous and widely used privacy principle for protecting private information. It requires that each tuple of a public released data table must be indistinguishable from at least other k -1 tuples. Give... 详细信息
来源: 评论