English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 484084      Online Users : 83
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41642

Title: An Optimal Two-dimensional Orthogonal Range Search Algorithm in VLSI Design Automation
Authors: Yu-Hsiang Pan;Kuo-Tien Lee;Yung-Hung Wang
Contributors: 國立臺灣海洋大學:環境生物與漁業科學學系
Date: 2011
Issue Date: 2017-03-14T06:14:04Z
Publisher: 2010 International Symposium on Computer, Communication, Control and Automation (3CA),
Abstract: Abstract:It is well known that an optimal algorithm for logarithm query time and linear storage for two dimensional orthogonal range searches is nonexistent except for very few cases in which certain computational models have been assumed. A new algorithm called sliding kd tree is presented in this article where the length of the query box is fixed in any direction. The new algorithm is optimal in handling two-dimensional problems, and can be applied to VLSI Design Automations presented to show the performance of the SKD algorithm.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41642
Appears in Collections:[環境生物與漁業科學學系] 演講及研討會

Files in This Item:

There are no files associated with this item.

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback