咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
On the number of elements to reorder when updating a suffix array
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2012年 第1期11卷 87-99页
作者: Leonard, M. Mouchard, L. Salson, M. Univ Rouen Dept Comp Sci LITIS EA 4108 F-76821 Mont St Aignan France Kings Coll London Dept Informat Algorithm Design Grp London WC2R 2LS England Univ Lille 1 LIFL UMR CNRS 8022 INRIA Lille Nord Europe Villeneuve Dascq France
Recently new algorithms appeared for updating the Burrows-Wheeler Transform or the suffix array, when the text they index is modified. These algorithms proceed by reordering entries and the number of such reordered en... 详细信息
来源: 评论
Optimizing to Memory Application in Embedded Multimedia Device
Optimizing to Memory Application in Embedded Multimedia Devi...
收藏 引用
International Conference on Advanced Design and Manufacturing Engineering (ADME 2011)
作者: Wang, Xiaosheng Yu, Qian Shandong Womens Univ Informat & Technol Sch Jinan Peoples R China
The modern embedded multimedia electronic devices rely on dynamically-allocated data structures to store and process their data, as a result, the demand of its memory capacity and dynamic are increasing unceasingly. I... 详细信息
来源: 评论
Skip quadtrees: dynamic data structures for multidimensional point sets
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2008年 第1-2期18卷 131-160页
作者: Eppstein, David Goodrich, Michael T. Sun, Jonathan Z. Univ Calif Irvine Donald Bren Sch Informat & Comp Sci Dept Comp Sci Irvine CA 92697 USA Univ So Mississippi Sch Comp Hattiesburg MS 39406 USA
We present a new multi-dimensional data structure, which we call the skip quadtree ( for point data in R-2) or the skip octree (for point data in R., with constant d > 2). Our data structure combines the best featu... 详细信息
来源: 评论
Shooting Permanent Rays among Disjoint Polygons in the Plane
Shooting Permanent Rays among Disjoint Polygons in the Plane
收藏 引用
25th Annual Symposium on Computational Geometry
作者: Ishaque, Mashhood Speckmann, Bettina Toth, Csaba D. Tufts Univ Dept Comp Sci Medford MA 02155 USA
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at the boundary of some obstacle. The port... 详细信息
来源: 评论
External Memory Planar Point Location with Logarithmic Updates
External Memory Planar Point Location with Logarithmic Updat...
收藏 引用
24th Annual Symposium on Computational Geometry
作者: Arge, Lars Brodal, Gerth Stolting Rao, S. Srinivasa Univ Aarhus Dept Comp Sci MADALGO DK-8200 Aarhus N Denmark
Point location is art extremely well-studied problem both in internal memory models and recently also in the external memory model. In this paper, we present an I/O-efficient dynamic data structure for point location ... 详细信息
来源: 评论
A dynamic clinical dental relational database
收藏 引用
IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE 2004年 第3期8卷 298-305页
作者: Taylor, D Naguib, RNG Boulton, S Coventry Univ Sch Math & Informat Sci BIOCORE Coventry CV1 5FB W Midlands England Coventry Hlth Author Dent Publ Hlth Dept Coventry CV1 2GQ W Midlands England
The traditional approach to relational database design is based on the logical organization of data into a number of related normalized tables. One assumption is that the nature and structure of the data is known at t... 详细信息
来源: 评论
Translating a regular grid over a point set
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2003年 第1-2期25卷 21-34页
作者: Bose, P van Kreveld, M Maheshwari, A Morin, P Morrison, J Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Utrecht Dept Comp Sci NL-3508 TB Utrecht Netherlands
We consider the problem of translating a (finite or infinite) square grid G over a set S of n points in the plane in order to maximize some objective function. We say that a grid cell is k-occupied if it contains k or... 详细信息
来源: 评论
A strategy to implement a dynamic dental epidemiological relational database
A strategy to implement a dynamic dental epidemiological rel...
收藏 引用
23rd Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society
作者: Taylor, D Naguib, RNG Amin, S James, A Boulton, S Coventry Univ Sch Math & Informat Sci BIOCORE Coventry W Midlands England
Dental surveys to collect data on the developing dentition of school aged children are routinely performed by Health Authorities in the UK. The information collected varies greatly from survey to survey, so that each ... 详细信息
来源: 评论
dynamic data structures for fat objects and their applications
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2000年 第4期15卷 215-227页
作者: Efrat, A Katz, MJ Nielsen, F Sharir, M Ben Gurion Univ Negev Dept Math & Comp Sci IL-84105 Beer Sheva Israel Tel Aviv Univ Sch Math Sci IL-69978 Tel Aviv Israel SONY Comp Sci Labs Inc Tokyo Japan NYU Courant Inst Math Sci New York NY USA
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R-2 or R-3. Our planar structures are actually fitted for a more general class of objects - (beta, delt... 详细信息
来源: 评论
Design considerations for a relational database schema to hold dental epidemiological data
Design considerations for a relational database schema to ho...
收藏 引用
Joint Meeting of the 3rd IEEE EMBS International Conference on Information Technology Applications in Biomedicine/3rd Workshop of the Int-Telemedical-Information-Society
作者: Taylor, D Naguib, RNG Amin, S James, A Boulton, S Coventry Univ Sch Math & Informat Sci Coventry CV1 5FB W Midlands England
Dental surveys to collect data on the developing dentition of school children are routinely performed by many health authorities in the UK. A standard software package is used by Health Authorities to store the result... 详细信息
来源: 评论