咨询与建议

限定检索结果

文献类型

  • 97 篇 期刊文献
  • 89 篇 会议
  • 4 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 172 篇 工学
    • 148 篇 计算机科学与技术...
    • 40 篇 软件工程
    • 18 篇 电气工程
    • 14 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 3 篇 仪器科学与技术
    • 3 篇 控制科学与工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 测绘科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 船舶与海洋工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物工程
  • 91 篇 理学
    • 86 篇 数学
    • 3 篇 生物学
    • 3 篇 统计学(可授理学、...
    • 1 篇 化学
    • 1 篇 地理学
    • 1 篇 地球物理学
    • 1 篇 系统科学
  • 12 篇 管理学
    • 12 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 5 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 药学(可授医学、理...
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学

主题

  • 190 篇 dynamic algorith...
  • 21 篇 graph algorithms
  • 16 篇 data structures
  • 15 篇 shortest paths
  • 14 篇 algorithms
  • 10 篇 computational ge...
  • 9 篇 online algorithm...
  • 8 篇 distributed algo...
  • 6 篇 parallel algorit...
  • 6 篇 planar graphs
  • 6 篇 transitive closu...
  • 6 篇 randomized algor...
  • 5 篇 performance
  • 5 篇 maximum matching
  • 5 篇 heuristic algori...
  • 4 篇 static algorithm...
  • 4 篇 graphs
  • 4 篇 languages
  • 4 篇 visibility
  • 4 篇 matching

机构

  • 8 篇 univ warwick cov...
  • 5 篇 tel aviv univ sc...
  • 5 篇 carnegie mellon ...
  • 4 篇 univ aquila dipa...
  • 4 篇 univ roma la sap...
  • 4 篇 univ vienna aust...
  • 4 篇 toyota technol i...
  • 4 篇 kth royal inst t...
  • 4 篇 tel aviv univ te...
  • 3 篇 univ warsaw inst...
  • 3 篇 bar ilan univ de...
  • 3 篇 bar ilan univ de...
  • 3 篇 max planck inst ...
  • 3 篇 swiss fed inst t...
  • 3 篇 columbia univ de...
  • 3 篇 ben gurion univ ...
  • 3 篇 kings coll londo...
  • 2 篇 univ roma tor ve...
  • 2 篇 univ copenhagen ...
  • 2 篇 cwi

作者

  • 10 篇 bhattacharya say...
  • 6 篇 frigioni daniele
  • 6 篇 henzinger monika
  • 5 篇 frigioni d
  • 5 篇 saranurak thatch...
  • 5 篇 nanongkai danupo...
  • 5 篇 d'angelo gianlor...
  • 4 篇 blelloch guy e.
  • 4 篇 d'emidio mattia
  • 4 篇 kiss peter
  • 4 篇 roditty liam
  • 4 篇 inkulu r.
  • 4 篇 zwick uri
  • 4 篇 nanni u
  • 4 篇 acar umut a.
  • 4 篇 bernstein aaron
  • 3 篇 cicerone serafin...
  • 3 篇 marchetti-spacca...
  • 3 篇 tangwongsan kana...
  • 3 篇 charalampopoulos...

语言

  • 180 篇 英文
  • 9 篇 其他
  • 1 篇 中文
检索条件"主题词=dynamic algorithms"
190 条 记 录,以下是1-10 订阅
排序:
Fully dynamic algorithms for Euclidean Steiner Tree  1
收藏 引用
18th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Chan, T-H Hubert Goranci, Gramoz Jiang, Shaofeng H-C Wang, Bo Xue, Quan Univ Hong Kong Hong Kong Peoples R China Univ Vienna Vienna Austria Peking Univ Beijing Peoples R China
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of terminal points X in R-d, possibly using points not in X which are called Steiner points. Even though near-linear ti... 详细信息
来源: 评论
dynamic algorithms against an Adaptive Adversary: Generic Constructions and Lower Bounds  2022
Dynamic Algorithms against an Adaptive Adversary: Generic Co...
收藏 引用
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Beimel, Amos Kaplan, Haim Mansour, Yishay Nissim, Kobbi Saranurak, Thatchaphol Stemmer, Uri Ben Gurion Univ Negev Beer Sheva Israel Tel Aviv Univ Google Res Tel Aviv Israel Georgetown Univ Washington DC USA Univ Michigan Ann Arbor MI 48109 USA
Given an input that undergoes a sequence of updates, a dynamic algorithm maintains a valid solution to some predefined problem at any point in time;the goal is to design an algorithm in which computing a solution to t... 详细信息
来源: 评论
dynamic algorithms and Asymptotic Theory for Lp-Norm Data Analysis
Dynamic Algorithms and Asymptotic Theory for Lp-Norm Data An...
收藏 引用
作者: Dhanaraj, Mayur Rochester Institute of Technology
学位级别:Ph.D., Doctor of Philosophy
The focus of this dissertation is the development of outlier-resistant stochastic algorithms for Principal Component Analysis (PCA) and the derivation of novel asymptotic theory for Lp-norm Principal Component Analysi... 详细信息
来源: 评论
Improved dynamic algorithms for Longest Increasing Subsequence  2021
Improved Dynamic Algorithms for Longest Increasing Subsequen...
收藏 引用
53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Kociumaka, Tomasz Seddighin, Saeed Univ Calif Berkeley Berkeley CA 94720 USA Toyota Technol Inst Chicago Chicago IL USA
We study dynamic algorithms for the longest increasing subsequence (LIS) problem. A dynamic LIS algorithm maintains a sequence subject to operations of the following form arriving one by one: insert an element, delete... 详细信息
来源: 评论
dynamic algorithms for Visibility Polygons in Simple Polygons
收藏 引用
International Journal of Computational Geometry and Applications 2020年 第1期30卷 51-78页
作者: Inkulu, R. Sowmya, K. Thakur, Nitish P. Department of Computer Science and Engineering IIT Guwahati India
We devise the following dynamic algorithms for both maintaining as well as querying for the visibility and weak visibility polygons amid vertex insertions and deletions to the simple polygon. A fully-dynamic algorithm... 详细信息
来源: 评论
Recent Advances in Fully dynamic Graph algorithms - A Quick Reference Guide
收藏 引用
ACM Journal of Experimental Algorithmics 2022年 第11期27卷 1-45页
作者: Hanauer, Kathrin Henzinger, Monika Schulz, Christian Faculty of Computer Science University of Vienna Währinger Str. 29 Vienna Vienna1090 Austria Heidelberg University Im Neuenheimer Feld 205 Baden-Württemberg Heidelberg69120 Germany
In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few o... 详细信息
来源: 评论
dynamic algorithms for the Massively Parallel Computation Model  19
Dynamic Algorithms for the Massively Parallel Computation Mo...
收藏 引用
31st ACM Symposium on Parallelism in algorithms and Architecturess (SPAA)
作者: Italiano, Giuseppe F. Lattanzi, Silvio Mirrokni, Vahab S. Parotsidis, Nikos LUISS Univ Rome Italy Google Res New York NY USA Google Res Zurich Switzerland Univ Copenhagen Copenhagen Denmark
The Massive Parallel Computing (MPC) model gained popularity during the last decade and it is now seen as the standard model for processing large scale data. One significant shortcoming of the model is that it assumes... 详细信息
来源: 评论
dynamic algorithms via the primal-dual method
收藏 引用
INFORMATION AND COMPUTATION 2018年 第Part2期261卷 219-239页
作者: Bhattacharya, Sayan Henzinger, Monika Italiano, Giuseppe Univ Warwick Coventry W Midlands England Univ Vienna Vienna Austria Univ Roma Tor Vergata Rome Italy
We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O(f(2))-approximately optimal solut... 详细信息
来源: 评论
ON dynamic algorithms FOR FACTORIZATION INVARIANTS IN NUMERICAL MONOIDS
收藏 引用
MATHEMATICS OF COMPUTATION 2017年 第307期86卷 2429-2447页
作者: Barron, Thomas O'Neill, Christopher Pelayo, Roberto Univ Kentucky Dept Math Lexington KY 40506 USA Texas A&M Univ Dept Math College Stn TX 77843 USA Univ Calif Davis Dept Math One Shields Ave Davis CA 95616 USA Univ Hawaii Dept Math Hilo HI 96720 USA
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and w-primality. While progress in this field has been acce... 详细信息
来源: 评论
Online and dynamic algorithms for Set Cover  2017
Online and Dynamic Algorithms for Set Cover
收藏 引用
49th Annual ACM-SIGACT Symposium on Theory of Computing (STOC)
作者: Gupta, Anupam Krishnaswamy, Ravishankar Kumar, Amit Panigrahi, Debmalya Carnegie Mellon Univ Pittsburgh PA 15213 USA Microsoft Res Bengaluru India IIT Delhi New Delhi India Duke Univ Durham NC 27706 USA
In this paper, we give new results for the set cover problem in the fully dynamic model. In this model, the set of "active" elements to be covered changes over time. The goal is to maintain a near-optimal so... 详细信息
来源: 评论