咨询与建议

限定检索结果

文献类型

  • 27 篇 期刊文献
  • 14 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 32 篇 工学
    • 27 篇 计算机科学与技术...
    • 7 篇 软件工程
    • 5 篇 电气工程
    • 2 篇 机械工程
    • 2 篇 信息与通信工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 仪器科学与技术
    • 1 篇 材料科学与工程(可...
  • 24 篇 理学
    • 23 篇 数学
    • 1 篇 生物学
  • 2 篇 医学
    • 2 篇 基础医学(可授医学...
    • 1 篇 临床医学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 42 篇 dynamic data str...
  • 5 篇 point location
  • 3 篇 planar subdivisi...
  • 3 篇 analysis of algo...
  • 3 篇 computational ge...
  • 2 篇 dynamic algorith...
  • 2 篇 binary tree
  • 2 篇 priority search ...
  • 2 篇 approximation al...
  • 2 篇 planar point loc...
  • 1 篇 multi-objective ...
  • 1 篇 68a20
  • 1 篇 range
  • 1 篇 octree
  • 1 篇 management of re...
  • 1 篇 h.3.3
  • 1 篇 lazy update
  • 1 篇 table look up
  • 1 篇 graph decomposit...
  • 1 篇 scalability

机构

  • 2 篇 brown univ dept ...
  • 2 篇 chinese univ hon...
  • 2 篇 univ illinois co...
  • 1 篇 natl inst inform...
  • 1 篇 inst sci & techn...
  • 1 篇 univ vienna fac ...
  • 1 篇 saarland univ d-...
  • 1 篇 univ minnesota d...
  • 1 篇 barcelona superc...
  • 1 篇 univ warsaw inst...
  • 1 篇 veermata jijabai...
  • 1 篇 univ politecn ca...
  • 1 篇 ewha womans univ...
  • 1 篇 tel aviv univ sc...
  • 1 篇 univ aarhus dept...
  • 1 篇 univ udine udine
  • 1 篇 nyu courant inst...
  • 1 篇 univ pisa dipart...
  • 1 篇 carleton univ sc...
  • 1 篇 shandong womens ...

作者

  • 3 篇 taylor d
  • 3 篇 boulton s
  • 3 篇 tamassia r
  • 3 篇 naguib rng
  • 2 篇 brodal gerth sto...
  • 2 篇 rao s. srinivasa
  • 2 篇 james a
  • 2 篇 wu xiaowei
  • 2 篇 arge lars
  • 2 篇 amin s
  • 1 篇 munro j. ian
  • 1 篇 chen yongquan
  • 1 篇 patel neel
  • 1 篇 mazowiecki filip
  • 1 篇 boris jp
  • 1 篇 meshram b. b.
  • 1 篇 sun jonathan z.
  • 1 篇 xiao wenlei
  • 1 篇 hussain tassadaq
  • 1 篇 pilipczuk michal

语言

  • 34 篇 英文
  • 8 篇 其他
检索条件"主题词=Dynamic Data Structure"
42 条 记 录,以下是31-40 订阅
排序:
On updating suffix tree labels
收藏 引用
THEORETICAL COMPUTER SCIENCE 1998年 第1-2期201卷 249-262页
作者: Ferragina, P Grossi, R Montangero, M Univ Florence Dipartimento Sistemi & Informat I-50121 Florence Italy Univ Pisa Dipartimento Informat I-56100 Pisa Italy Univ Salerno Dipartimento Informat & Applicaz R Capocelli I-84100 Salerno Italy
We investigate the problem of maintaining the are labels in the suffix tree data structure (Gusfield et al., 1992;Amir et al., 1994) when it undergoes string insertions and deletions. In current literature, this probl... 详细信息
来源: 评论
Maintaining the classes of 4-edge-connectivity in a graph on-line
收藏 引用
ALGORITHMICA 1998年 第3期20卷 242-276页
作者: Dinitz, Y Westbrook, J Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel AT&T Bell Labs Res Florham Pk NJ 07932 USA Yale Univ Dept Comp Sci New Haven CT 06520 USA
Two vertices of an undirected graph are called k-edge-connected if there exist k edge-disjoint paths between them (equivalently, they cannot be disconnected by the removal of less than k edges from the graph). Equival... 详细信息
来源: 评论
Rounding arrangements dynamically
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1998年 第2期8卷 157-178页
作者: Guibas, LJ Marimont, DH Stanford Univ Dept Comp Sci Stanford CA 94305 USA Xerox Corp Palo Alto Res Ctr Palo Alto CA 94304 USA
We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene(7) and Hobby,(11) it rounds the endp... 详细信息
来源: 评论
An improved dynamically allocated data structure scheme for power system problems
收藏 引用
International Journal of Modelling & Simulation 1997年 第2期17卷 61-61页
作者: Yehia, M. Chedid, R. Jaber, Z. Ilic, M. American University of Beirut New York NY 10022 850 Third Ave. Lebanon Massachusetts Inst. of Technology Cambridge MA 02139 77 Mass. Ave. United States
This paper proposes two new dynamically allocated data structures for large and sparse matrices occurring in electric power system problems. The proposed data structures have the features of optimizing memory requirem... 详细信息
来源: 评论
On-line maintenance of triconnected components with SPQR-trees
收藏 引用
ALGORITHMICA 1996年 第4期15卷 302-318页
作者: DiBattista, G Tamassia, R UNIV ROMA LA SAPIENZA DIPARTIMENTO INFORMAT & SISTEMIST I-00185 ROME ITALY BROWN UNIV DEPT COMP SCI PROVIDENCE RI 02912 USA
We consider the problem of maintaining on-line the triconnected components of a graph G. Let n be the current number of vertices of G. We present an O (rt)-space data structure that supports insertions of vertices and... 详细信息
来源: 评论
NEW RESULTS ON dynamic PLANAR POINT LOCATION
收藏 引用
SIAM JOURNAL ON COMPUTING 1992年 第5期21卷 972-999页
作者: SIU, WC JANARDAN, R UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455
A point location scheme is presented for a dynamic planar subdivision whose underlying graph is only required to be connected. The operations supported include: reporting the name of the region containing a query poin... 详细信息
来源: 评论
DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1992年 第3期2卷 311-333页
作者: Chiang, Yi-Jen Tamassia, Roberto Brown Univ Dept Comp Sci Providence RI 02912 USA
We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translat... 详细信息
来源: 评论
AN INCREMENTAL RECONSTRUCTION METHOD FOR dynamic PLANAR POINT LOCATION
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第2期37卷 79-83页
作者: TAMASSIA, R UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801
We present a fully dynamic technique for point location in triangulations that allows a tradeoff between query and update time, and can be used in conjunction with any of the known static point location data structure... 详细信息
来源: 评论
dynamic MAINTENANCE OF PLANAR DIGRAPHS, WITH APPLICATIONS
收藏 引用
ALGORITHMICA 1990年 第4期5卷 509-527页
作者: TAMASSIA, R PREPARATA, FP UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801
We show that a planarst-graphG admits two total orders on the setV∪E ∪F, whereV, E, andF are respectively the set of vertices, edges, and faces ofG, with |V| =n. Assuming thatG is to be dynamically modified by means... 详细信息
来源: 评论
A PRACTICAL METHOD FOR COMPRESSING SPARSE MATRICES WITH VARIANT ENTRIES
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年 第3-4期36卷 163-173页
作者: AOE, J Department of Information Science and Intelligent Systems The University of Tokushima Minami-Josanjima-Cho Tokushima-Shi 770 Japan
A row displacement method compresses efficiently a sparse matrix into a one-dimensional array. The access time with this method isO(l), but the application was restricted to the static matrices. In order to extend the... 详细信息
来源: 评论