Search for Topics All Reviews
	Browse All Reviews > Data (E) > Data Structures (E.1) > Trees (E.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 52 Reviews about "Trees (E.1...)": Date Reviewed   Edge-independent spanning trees in augmented cubes Wang Y., Shen H., Fan J. Theoretical Computer Science 67023-32, 2017.  Type: Article The efficient construction of edge-independent spanning trees (EISTs) is interesting in itself, but also has important applications in network communications, for example, protocol design, secure communication, and fault-tolerant commu... Jun 6 2017   Posterior expectation of regularly paved random histograms Sainudiin R., Teng G., Harlow J., Lee D. ACM Transactions on Modeling and Computer Simulation 23(1): 1-20, 2013.  Type: Article Parametric and nonparametric supervised machine learning algorithms are useful in artificial intelligence (AI). The literature of the field includes illustrations of decision-tree-based classifiers for hyperplanes, higher-order dimensi... May 3 2013   Comparative performance evaluation of the AVL and red-black trees Štrbac-Savić S., Tomašević M.  BCI 2012 (Proceedings of the 5th Balkan Conference in Informatics, Novi Sad, Serbia, Sep 16-20, 2012) 14-19, 2012.  Type: Proceedings Balancing binary trees provides efficient searching with overall O(log n) performance for retrieval and maintenance operations. The first data structure of this kind was proposed by Adelson-Velskii... Nov 12 2012   Biased range trees Dujmović V., Howat J., Morin P. Algorithmica 62(1-2): 21-37, 2012.  Type: Article A two-sided orthogonal range counting query over a finite set S of n points in R2 asks, given a query point q = (qx, qy<... Nov 8 2012   Strict Fibonacci heaps Brodal G., Lagogiannis G., Tarjan R.  STOC 2012 (Proceedings of the 44th Symposium on Theory of Computing, New York, NY, May 19-22, 2012) 1177-1184, 2012.  Type: Proceedings In computer science, heaps are special tree-based data structures, which are commonly manipulated with operations such as create-heap, insert, find-min, and delete. Heaps have interesting properties and are ... Jul 18 2012   Self-adaptive induction of regression trees Fidalgo-Merino R., Nunez M. IEEE Transactions on Pattern Analysis and Machine Intelligence 33(8): 1659-1672, 2011.  Type: Article This paper is concerned with the question of how a learning system can deal with a changing environment. For example, a system that has learned a linear function needs to deal with changes in the intercept and the slope of the function... Dec 6 2011   The register function for t-ary trees Drmota M., Prodinger H. ACM Transactions on Algorithms 2(3): 318-334, 2006.  Type: Article This paper deals with register functions, which were introduced by Ershov. This function is equivalent to the Strahler number introduced by hydrogeologists. The function is recursively defined by reg[root] = 0, and, if a binary tree May 8 2007   Finding 3-shredders efficiently Hegde R. ACM Transactions on Algorithms 2(1): 14-43, 2006.  Type: Article A k-shredder in an undirected graph is a vertex cut of size k whose removal results in at least three components. The author presents a linear algorithm to find the set of 3-shredders in a 3-connected graph. The algorithm... Jun 20 2006   An adaptive path index for XML data using the query workload Min J., Chung C., Shim K. Information Systems 30(6): 467-487, 2005.  Type: Article Extensible Markup Language (XML) path queries are fundamental to many XML query languages, like XQuery and XPath, which are often used for complex filtering of XML data. Most XML path query processing techniques use either navigation-b... Mar 28 2006   A New Distance for High Level RNA Secondary Structure Comparison Allali J., Sagot M. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2(1): 3-14, 2005.  Type: Article When I read the title of this paper, I expected an interesting contribution to the important problem of measuring the similarity between RNA molecules. Regrettably, this paper presents a questionable solution to a doubtful problem. Aft... Jan 12 2006       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy