Filters








3,316 Hits in 3.6 sec

On the internal path length ofd-dimensional quad trees

Ralph Neininger, Ludger R�schendorf
<span title="">1999</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wtbq2zeu3fctdhu67pe2vn6hti" style="color: black;">Random structures &amp; algorithms (Print)</a> </i> &nbsp;
It is proved that the internal path length of a d-dimensional quad tree after normalization converges in distribution.  ...  In the final part of the paper we state similar results for general split tree models if the expectation of the path length has a similar expansion as in the case of quad trees.  ...  Let Y n denote the internal path length of the random d-dimensional quad tree, i.e.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-2418(199908)15:1&lt;25::aid-rsa2&gt;3.0.co;2-r">doi:10.1002/(sici)1098-2418(199908)15:1&lt;25::aid-rsa2&gt;3.0.co;2-r</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3fmdc6ognaqbnkwaihredrcly">fatcat:h3fmdc6ognaqbnkwaihredrcly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070824125908/http://www.stochastik.uni-freiburg.de/homepages/rueschendorf/papers/quadrevv-990604.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ab/e6/abe65fe97431a61e18ef35c8ccf85faee1e09cd6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-2418(199908)15:1&lt;25::aid-rsa2&gt;3.0.co;2-r"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Page 5683 of Mathematical Reviews Vol. , Issue 2000h [page]

<span title="">2000</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Arcones (Binghamton, NY) 2000h:60034 60F05 60C05 68Q25 68R10 Neininger, Ralph (D-FRBG-S; Freiburg); Riischendorf, Ludger (D-FRBG-S; Freiburg) On the internal path length of d-dimensional quad trees.  ...  The analysis is based on the contraction method. It is proved that the internal path length of the A-dimensional quad tree after nor- malization converges in distribution.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-08_2000h/page/5683" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2000-08_2000h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Data Structures for Minimization of Total Within-Group Distance for Spatio-temporal Clustering [chapter]

Vladimir Estivill-Castro, Michael E. Houle
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper introduces data structures for the management of large bi-dimensional point data sets and for fast clustering via interchange heuristics.  ...  Statistical principles suggest minimization of the total withingroup distance (TWGD) as a robust criterion for clustering point data associated with a Geographical Information System [17] .  ...  Then, neighbors and siblings of the parent of B in the overlay are D-dimensional boxes with length 2l per side.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44794-6_8">doi:10.1007/3-540-44794-6_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qs53rj23mzegrdoil4bk24xoyq">fatcat:qs53rj23mzegrdoil4bk24xoyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501122224/https://link.springer.com/content/pdf/10.1007%2F3-540-44794-6_8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/e8/31e8f845842a513e4589e935fb4879b83007b82d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44794-6_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Enhancing Performance of GIS on Cloud Computing

Ahmed Teaima, Hesham Ahmed, BahaaShabana B.S
<span title="">2015</span> <i title="The Science and Information Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2yzw5hsmlfa6bkafwsibbudu64" style="color: black;">International Journal of Advanced Computer Science and Applications</a> </i> &nbsp;
This paper will study some example of a data structure like a K-d tree and Quad trees of GIS application and compare between them when storing these data structures on Cloud computing, the paper also portrays  ...  the results of the study of data structure on cloud computing platforms to retrieve data from cloud computing.  ...  To improve performance of K-d tree and Quad tree have different shapes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2015.061106">doi:10.14569/ijacsa.2015.061106</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lqdmgboirjfcjcaf7rm22w767m">fatcat:lqdmgboirjfcjcaf7rm22w767m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719054802/http://thesai.org/Downloads/Volume6No11/Paper_6-Enhancing_Performance_of_GIS_on_Cloud_Computing.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/64/de640649195ec6e203fee63757faa8b236fe0c2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14569/ijacsa.2015.061106"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Two-dimensional packet classification algorithm using a quad-tree

Hyesook Lim, Min Young Kang, Changhoon Yim
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mnyvgmlsc5a5xi7554ow77exfu" style="color: black;">Computer Communications</a> </i> &nbsp;
In constructing a quad-tree generated based on recursive space decomposition, the priority of rules is primarily considered in the proposed algorithm.  ...  In this paper, we propose a priority-based quad-tree (PQT) algorithm for packet classification.  ...  Acknowledgement This research was supported by the Ministry of Information and Communications, Korea, under a HNRC-ITRC support program supervised by IITA.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comcom.2007.01.004">doi:10.1016/j.comcom.2007.01.004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lmw3udhu6bdi7mmn3jr3z67ftq">fatcat:lmw3udhu6bdi7mmn3jr3z67ftq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810145338/http://konkuk.ac.kr/~cyim/publication/ComCom2007.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/66/de6620cf576490117a5d485580573462418224d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comcom.2007.01.004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Enhancing Quad Tree for Spatial Index Using Space Filling Curves

Ali A. Hussain, Rehab F. Hassan
<span title="2020-04-25">2020</span> <i title="University of Technology"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/m3ejdmjiu5az3gwi7cjmxybefu" style="color: black;">Engineering and Technology Journal</a> </i> &nbsp;
In this paper, the quad tree was improved by combining it with one of the space filling curve types, resulting in reduced storage space requirements and improved implementation time  ...  Spatial indexes, such as those based on the Quad Tree, are important in spatial databases for the effective implementation of queries with spatial constraints, especially when queries involve spatial links  ...  In Quad tree every one of the nodes includes <x, y, width, NE, NW, SE, SW> where x, y represents the location of top left corner of the square width is the side length.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30684/etj.v38i1b.264">doi:10.30684/etj.v38i1b.264</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/znc47winebffvesejdgrfprq7e">fatcat:znc47winebffvesejdgrfprq7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200512234744/http://engtechjournal.org/index.php/et/article/download/264/938" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/69/b1/69b13125ec23c994cf451ed1ad8b48e3c82e61c7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30684/etj.v38i1b.264"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

GPU-based dynamic search on adaptive resolution grids

Francisco M. Garcia, Mubbasir Kapadia, Norman I. Badler
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nytnrt3gtzbixld5r6a4talbky" style="color: black;">2014 IEEE International Conference on Robotics and Automation (ICRA)</a> </i> &nbsp;
Our work proposes an adaptive subdivision of the environment with efficient indexing, update, and neighbor-finding operations on the GPU to address several known limitations in prior work.  ...  Our work proposes an adaptive subdivision of the environment with efficient indexing, update, and neighbor-finding operations on the GPU to address several known limitations in prior work.  ...  The figure shows the ratio of the average path lengths for all agents in various test cases with the average path lengths for the uniform grid.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icra.2014.6907070">doi:10.1109/icra.2014.6907070</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icra/GarciaKB14.html">dblp:conf/icra/GarciaKB14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4pkcx3nunbhiplt55abqov47je">fatcat:4pkcx3nunbhiplt55abqov47je</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921215958/http://repository.upenn.edu/cgi/viewcontent.cgi?article=1164&amp;context=hms" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/db/fedb3ecc7f69229ae4be1f9b30bd6f6307570822.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icra.2014.6907070"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A new range query algorithm for Universal B-trees

Tomáš Skopal, Michal Krátký, Jaroslav Pokorný, Václav Snášel
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/epn2gc3fozcsphiz3xnhmwom7u" style="color: black;">Information Systems</a> </i> &nbsp;
In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases.  ...  More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation. r  ...  GAČ R 201/03/0912 of the Grant Agency of the Czech Republic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.is.2004.12.001">doi:10.1016/j.is.2004.12.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lg6ncdazr5as5eytqpoecas5om">fatcat:lg6ncdazr5as5eytqpoecas5om</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120712161732/http://siret.ms.mff.cuni.cz/skopal/pub/new_rq.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/28/c128c60423daf4b3cc6fa24f01b712575b5828da.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.is.2004.12.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Experimental Analysis of the Accessibility of Drawings with Few Segments [chapter]

Philipp Kindermann, Wouter Meulemans, André Schulz
<span title="">2018</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We asked the users to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.  ...  The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges.  ...  Acknowledgments The authors would like to thank all anonymous volunteers who participated in the presented user study.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-73915-1_5">doi:10.1007/978-3-319-73915-1_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zzi4dnw62rdudlnc5tkq54tq5e">fatcat:zzi4dnw62rdudlnc5tkq54tq5e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722101109/https://pure.tue.nl/ws/files/93174558/paper_53.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/c9/22c9f25f3566bd60f883544111050c9c3fb0979d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-73915-1_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Experimental Analysis of the Accessibility of Drawings with Few Segments

Philipp Kindermann, Wouter Meulemans, André Schulz
<span title="">2018</span> <i title="Journal of Graph Algorithms and Applications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4joumle7hffilk276fkubvhxcq" style="color: black;">Journal of Graph Algorithms and Applications</a> </i> &nbsp;
We asked the users to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.  ...  The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges.  ...  Acknowledgments The authors would like to thank all anonymous volunteers who participated in the presented user study and the anonymous reviewers for their valuable input.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00474">doi:10.7155/jgaa.00474</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/27ogon6pd5a3dl6tlhqlra3jh4">fatcat:27ogon6pd5a3dl6tlhqlra3jh4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307092113/http://pdfs.semanticscholar.org/f6f2/3af1228d045acb1815928f82b4f931fb113c.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/f2/f6f23af1228d045acb1815928f82b4f931fb113c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7155/jgaa.00474"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks

M. Demirbas, X. Lu
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jtcdcetsmvdmjcshq24lhzakwu" style="color: black;">2007 IEEE International Conference on Communications</a> </i> &nbsp;
To address these challenges, we exploit location information and geometry of the network and present an in-network querying infrastructure, namely distributed quad-tree (DQT) structure.  ...  "d" to the nearest event in the network.  ...  The sibling links only exist between nodes on the same level in the structure. Fig.3 illustrates the point of view of an intermediate node 003 in the distributed quad-tree structure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icc.2007.551">doi:10.1109/icc.2007.551</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icc/DemirbasL07.html">dblp:conf/icc/DemirbasL07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/je7ru55cpvd55kizncdalllyuq">fatcat:je7ru55cpvd55kizncdalllyuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080424151916/http://www.cse.buffalo.edu/~demirbas/publications/dqt.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/e8/79e823d7b132fba7e56cba338fdfa9cefc2afded.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icc.2007.551"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Dependence and phase changes in random m-ary search trees [article]

Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
<span title="2016-02-25">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the joint asymptotic behavior of the space requirement and the total path length (either summing over all root-key distances or over all root-node distances) in random m-ary search trees.  ...  Such a less anticipated phenomenon is not exceptional and we extend the results in two directions: one for more general shape parameters, and the other for other classes of random log-trees such as fringe-balanced  ...  Let V n = (Ξ n , L n ) denote the vector of internal path length and the number of leaves in a random d-dimensional quadtree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.05135v3">arXiv:1501.05135v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sygrmd6e75bqhkm4kqmgz2qo7i">fatcat:sygrmd6e75bqhkm4kqmgz2qo7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910163009/https://arxiv.org/pdf/1501.05135v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/9d/eb9d046dd904caa7d23dcc0fe5bf1dfcd1a4ff7c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.05135v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Dependence and phase changes in randomm-ary search trees

Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
<span title="2016-08-30">2016</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wtbq2zeu3fctdhu67pe2vn6hti" style="color: black;">Random structures &amp; algorithms (Print)</a> </i> &nbsp;
We study the joint asymptotic behavior of the space requirement and the total path length (either summing over all root-key distances or over all root-node distances) in random m-ary search trees.  ...  Such a less anticipated phenomenon is not exceptional and we extend the results in two directions: one for more general shape parameters, and the other for other classes of random log-trees such as fringe-balanced  ...  Let V n = (Ξ n , L n ) denote the vector of internal path length and the number of leaves in a random d-dimensional quadtree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/rsa.20659">doi:10.1002/rsa.20659</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/34y265ufuzgvti6qpoho42homq">fatcat:34y265ufuzgvti6qpoho42homq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812131207/http://www.math.uni-frankfurt.de/~neiningr/dependence_m_ary.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ab/2a/ab2a67e8f52072be4a1be05760749289dd16f256.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/rsa.20659"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Escaping Depressions in LRTS Based on Incremental Refinement of Encoded Quad-Trees

Yue Hu, Long Qin, Quanjun Yin, Lin Sun
<span title="">2017</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wpareqynwbgqdfodcyhh36aqaq" style="color: black;">Mathematical Problems in Engineering</a> </i> &nbsp;
By virtue of the idea of state aggregation and heuristic generalization, our EQ LRTS (encoded quad-tree based LRTS) possesses the ability of quickly escaping from heuristic depressions with less state  ...  In the context of robot navigation, game AI, and so on, real-time search is extensively used to undertake motion planning.  ...  Acknowledgments The work described in this paper is sponsored by the National Natural Science Foundation of China under Grant no. 61473330 and Grant no. 61573369.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2017/1850678">doi:10.1155/2017/1850678</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ak5ztp6kjh5nkdfzdalputlbm">fatcat:4ak5ztp6kjh5nkdfzdalputlbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502202051/http://downloads.hindawi.com/journals/mpe/2017/1850678.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/ca/ecca9a5ebc8bdbc4a6cc5bd85c831d3473bb6e49.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2017/1850678"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

MD-HBase: A Scalable Multi-dimensional Data Infrastructure for Location Aware Services

Shoji Nishimura, Sudipto Das, Divyakant Agrawal, Amr El Abbadi
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4dx63pqjlvhgnpxex7o4qtt2ta" style="color: black;">2011 IEEE 12th International Conference on Mobile Data Management</a> </i> &nbsp;
We present the design of MD-HBase that builds two standard index structures-the K-d tree and the Quad tree-over a range partitioned Key-value store.  ...  On the other hand, the index layer allows efficient multi-dimensional query processing.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their helpful comments. This work is partly funded by NSF grants III 1018637 and CNS 1053594.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mdm.2011.41">doi:10.1109/mdm.2011.41</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mdm/NishimuraDAA11.html">dblp:conf/mdm/NishimuraDAA11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4rrigdhhrzg27mdsbti6mzziuq">fatcat:4rrigdhhrzg27mdsbti6mzziuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120131160319/http://www.cs.ucsb.edu:80/~sudipto/papers/md-hbase.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bf/c4/bfc464efbe615805d386ef5c882e4d0f97071ec2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mdm.2011.41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,316 results