咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是31-40 订阅
排序:
dynamic Routing and Spectrum Assignment Based on the Consecutive Sub-Channels in Flexible-Grid Optical Networks
收藏 引用
IEEE ACCESS 2022年 10卷 128354-128365页
作者: Lohani, Varsha Sharma, Anjali Singh, Yatindra Nath Indian Inst Technol Kanpur Dept Elect Engn Kanpur India
Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient spectrum use by allocating integral multiple o... 详细信息
来源: 评论
On Regularity Lemma and Barriers in Streaming and dynamic Matching  2023
On Regularity Lemma and Barriers in Streaming and Dynamic Ma...
收藏 引用
55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)
作者: Assadi, Sepehr Behnezhad, Soheil Khanna, Sanjeev Li, Huan Rutgers State Univ New Brunswick NJ 08903 USA Northeastern Univ Boston MA USA Univ Penn Philadelphia PA USA
We present a new approach for finding matchings in dense graphs by building on Szemeredi's celebrated Regularity Lemma. This allows us to obtain non-trivial albeit slight improvements over longstanding bounds for ... 详细信息
来源: 评论
Approximating Edit Distance in the Fully dynamic Model  64
Approximating Edit Distance in the Fully Dynamic Model
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Kociumaka, Tomasz Mukherjee, Anish Saha, Barna Max Planck Inst Informat Saarland Informat Campus Saarbrucken Germany Univ Warwick Coventry W Midlands England Univ Calif Dept Comp Sci & Engn San Diego CA USA
The edit distance is a fundamental measure of sequence similarity, defined as the minimum number of character insertions, deletions, and substitutions needed to transform one string into the other. Given two strings o... 详细信息
来源: 评论
New Partitioning Techniques and Faster algorithms for Approximate Interval Scheduling
收藏 引用
ALGORITHMICA 2024年 第9期86卷 2997-3026页
作者: Compton, Spencer Mitrovic, Slobodan Rubinfeld, Ronitt Stanford Univ Comp Sci Dept 353 Jane Stanford Way Stanford CA 94305 USA Univ Calif Davis Comp Sci Dept Kemper Hall Davis CA 95616 USA MIT CSAIL 32 Vassar St Cambridge MA 02139 USA
Interval scheduling is a basic algorithmic problem and a classical task in combinatorial optimization. We develop techniques for partitioning and grouping jobs based on their starting/ending times, enabling us to view... 详细信息
来源: 评论
dynamic (1+ε)-Approximate Matching Size in Truly Sublinear Update Time  64
Dynamic (1+ε)-Approximate Matching Size in Truly Sublinear ...
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol Univ Warwick Coventry W Midlands England Univ Michighan Ann Arbor MI USA
We show a fully dynamic algorithm for maintaining (1 + epsilon)-approximate size of maximum matching of the graph with n vertices and m edges using m(0.5-Omega epsilon(1)) update time. This is the first polynomial imp... 详细信息
来源: 评论
The Complexity of dynamic Least-Squares Regression  64
The Complexity of Dynamic Least-Squares Regression
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Jiang, Shunhua Peng, Binghui Weinstein, Omri Columbia Univ Dept Comp Sci New York NY 10027 USA Hebrew Univ Jerusalem Dept Comp Sci Jerusalem Israel
We settle the complexity of dynamic least-squares regression (LSR), where rows and labels (A((t)), b((t))) can be adaptively inserted and/or deleted, and the goal is to efficiently maintain an epsilon-approximate solu... 详细信息
来源: 评论
dynamic treewidth  64
Dynamic treewidth
收藏 引用
64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)
作者: Korhonen, Tuukka Majewski, Konrad Nadara, Wojciech Pilipczuk, Michal Sokolowski, Marek Univ Bergen Dept Informat Bergen Norway Univ Warsaw Inst Informat Warsaw Poland
We present a data structure that for a dynamic graph G that is updated by edge insertions and deletions, maintains a tree decomposition of G of width at most 6k + 5 under the promise that the treewidth of G never grow... 详细信息
来源: 评论
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2014年 第2期47卷 240-247页
作者: Chan, Timothy M. Pathak, Vinayak Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada
At SODA'1 0, Agarwal and Sharathkumar presented a streaming algorithm for approximating the minimum enclosing ball of a set of points in d-dimensional Euclidean space. Their algorithm requires one pass, uses O(d) ... 详细信息
来源: 评论
Improved dynamic Colouring of Sparse Graphs  2023
Improved Dynamic Colouring of Sparse Graphs
收藏 引用
55th Annual ACM Symposium on Theory of Computing (STOC) part of the ACM Federated Computing Research Conference (FCRC)
作者: Christiansen, Aleksander Bjorn Grodt Nowicki, Krzysztof Rotenberg, Eva Tech Univ Denmark Lyngby Denmark Univ Copenhagen Copenhagen Denmark Pathway Com Krakow Poland
Given a dynamic graph subject to edge insertions and deletions, we show how to update an implicit representation of a proper vertex colouring, such that colours of vertices are computable upon query time. We give a de... 详细信息
来源: 评论
Top-k Distance Queries on Large Time-Evolving Graphs
收藏 引用
IEEE ACCESS 2023年 11卷 102228-102242页
作者: D'Ascenzo, Andrea D'Emidio, Mattia Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy
Fast extraction of top- k distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purpose... 详细信息
来源: 评论