講者：Tsai-Yen Li
日期：2020-04-28
觀看: 892
  • 00:00 1.
    Geometric Reasoning and Applications: Orthogonal Range Searching
  • 01:02 2.
    Orthogonal Range Searching
  • 02:56 3.
    Interpret DB Queries Geometrically
  • 06:54 4.
    1-D Range Searching (I)
  • 11:32 5.
    1-D Range Searching (II)
  • 15:29 6.
    Finding the Split Node
  • 21:01 7.
    1D Range Query Algorithm (I)
  • 24:00 8.
    1D Range Query Algorithm (II)
  • 35:40 9.
    1D-Range Search Algorithm: Analysis
  • 39:15 10.
    Kd-Trees (I)
  • 40:15 11.
    Kd-Trees (I)
  • 41:25 12.
    Kd-Trees (II)
  • 45:59 13.
    The BuildKDTree Algorithm
  • 49:23 14.
    The BuildKDTree Algorithm
  • 49:49 15.
    Construction Time Analysis
  • 1:02:50 16.
    Querying on a kd-Tree (I)
  • 1:06:14 17.
    Querying on a kd-Tree (II)
  • 1:16:47 18.
    Querying on a kd-Tree (II)
  • 1:17:21 19.
    Querying on a kd-Tree (III)
  • 1:18:01 20.
    The SearchKDTree Algorithm
  • 1:20:41 21.
    2D KD-Tree Query Time Analysis
  • 1:28:08 22.
    KD-Tree Query Time Analysis
  • 1:29:15 23.
    Basics of Range Trees
  • 1:29:28 24.
    Basics of Range Trees
  • 1:32:08 25.
    Range Trees
  • 1:36:09 26.
    Example of Range Tree
  • 1:37:54 27.
    The Build2DRangeTree Algorithm
  • 1:41:10 28.
    The 2DRangeQuery Algorithm (I)
  • 1:41:37 29.
    The 2DRangeQuery Algorithm (II)
  • 1:43:10 30.
    Range Tree Algorithm Analysis
  • 1:52:21 31.
    Range Tree in Higher Dimensions
  • 1:54:11 32.
    General Sets of Points
  • 1:57:28 33.
    Basics of Fractional Cascading (I)
  • 2:07:45 34.
    Basics of Fractional Cascading (II)
  • 2:09:02 35.
    Fractional Cascading Algorithm Analysis
  • 索引
  • 筆記
  • 全螢幕
gra05
長度: 2:13:26, 瀏覽: 893, 最近修訂: 2020-04-28
    上一篇 下一篇
    • 00:00 1.
      Geometric Reasoning and Applications: Orthogonal Range Searching
    • 01:02 2.
      Orthogonal Range Searching
    • 02:56 3.
      Interpret DB Queries Geometrically
    • 06:54 4.
      1-D Range Searching (I)
    • 11:32 5.
      1-D Range Searching (II)
    • 15:29 6.
      Finding the Split Node
    • 21:01 7.
      1D Range Query Algorithm (I)
    • 24:00 8.
      1D Range Query Algorithm (II)
    • 35:40 9.
      1D-Range Search Algorithm: Analysis
    • 39:15 10.
      Kd-Trees (I)
    • 40:15 11.
      Kd-Trees (I)
    • 41:25 12.
      Kd-Trees (II)
    • 45:59 13.
      The BuildKDTree Algorithm
    • 49:23 14.
      The BuildKDTree Algorithm
    • 49:49 15.
      Construction Time Analysis
    • 1:02:50 16.
      Querying on a kd-Tree (I)
    • 1:06:14 17.
      Querying on a kd-Tree (II)
    • 1:16:47 18.
      Querying on a kd-Tree (II)
    • 1:17:21 19.
      Querying on a kd-Tree (III)
    • 1:18:01 20.
      The SearchKDTree Algorithm
    • 1:20:41 21.
      2D KD-Tree Query Time Analysis
    • 1:28:08 22.
      KD-Tree Query Time Analysis
    • 1:29:15 23.
      Basics of Range Trees
    • 1:29:28 24.
      Basics of Range Trees
    • 1:32:08 25.
      Range Trees
    • 1:36:09 26.
      Example of Range Tree
    • 1:37:54 27.
      The Build2DRangeTree Algorithm
    • 1:41:10 28.
      The 2DRangeQuery Algorithm (I)
    • 1:41:37 29.
      The 2DRangeQuery Algorithm (II)
    • 1:43:10 30.
      Range Tree Algorithm Analysis
    • 1:52:21 31.
      Range Tree in Higher Dimensions
    • 1:54:11 32.
      General Sets of Points
    • 1:57:28 33.
      Basics of Fractional Cascading (I)
    • 2:07:45 34.
      Basics of Fractional Cascading (II)
    • 2:09:02 35.
      Fractional Cascading Algorithm Analysis
    位置
    1. 知識庫
    2. ...
    3. 資科系 李蔡彥老師
    資料夾名稱
    資科系 李蔡彥老師
    發表人
    李蔡彥
    單位
    nccu
    建立
    2020-04-28 09:10:10
    最近修訂
    2020-04-28 11:20:04
    長度
    2:13:26
    © Copyright since 2016 by NATIONAL CHENGCHI UNIVERSITY
    All rights reserved.