Search for Topics All Reviews
	Browse All Reviews > Data (E) > Files (E.5) > Sorting/Searching (E.5...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 10 Reviews about "Sorting/Searching (E.5...)": Date Reviewed    BlockQuicksort: avoiding branch mispredictions in Quicksort Edelkamp S., Weiß A. Journal of Experimental Algorithmics 24(1): 1-22, 2019.  Type: Article Quite often algorithms with bad worst-case complexity perform better on the average. Quicksort falls into this class. However, one of the drawbacks of Quicksort is that it is vulnerable to branch mispredictions, that is, branch misses.... Apr 1 2022   Community search over big graphs Huang X., Lakshmanan L., Xu J., Morgan&Claypool Publishers, San Rafael, CA, 2019. 208 pp.  Type: Book (978-1-681735-95-5) Community structures exist normally in numerous real-world networks. Social, biological, and communication networks are some examples of community structures. In the first chapter of the book, the authors discuss some applications for ... Dec 19 2019   Centrality and diversity in search: roles in A.I., machine learning, social networks, and pattern recognition Murty M., Biswas A., Springer International Publishing, New York, NY, 2019. 94 pp.  Type: Book (978-3-030247-12-6) This book is part of the “SpringerBriefs in Intelligent Systems” series, which covers diverse areas of intelligent systems, including artificial intelligence (AI), multiagent systems, and cognitive robotics. From th... Dec 10 2019   Constant time parallel sorting: an empirical view Gasarch W., Golub E., Kruskal C. Journal of Computer and System Sciences 67(1): 63-91, 2003.  Type: Article It is well known that sorting a list of n elements is possible with O(n ˙ log n) comparisons. If we have several processors working in parallel, then we can sort n elemen... Nov 21 2003   Approximating shortest superstrings with constraints Jiang T., Li M. (ed) Theoretical Computer Science 134(2): 473-491, 1994.  Type: Article The general problem of finding the shortest superstring to a given number of strings (that is, the shortest string such that all given strings appear as substrings) is NP-complete. The authors, with Blum, Tromp, and Yannakakis [1], hav... Nov 1 1995   Trie Hashing with Controlled Load Litwin W., Roussopoulos N., Levy G., Hong W. IEEE Transactions on Software Engineering 17(7): 678-691, 1991.  Type: Article The trie hash data structure uses a binary tree to represent the M-ary tree of the traditional trie. With trie hashing, a file may evolve dynamically and may be accessed both directly for a single record or over a range for multiple re... Apr 1 1992   New techniques for best-match retrieval Shasha D. (ed), Wang T. ACM Transactions on Information Systems 8(2): 140-158, 2001.  Type: Article The best-match problem involves finding the objects in a file that are closest to some specified object. Two major issues are the choice of an appropriate measure of closeness and efficient implementation. This paper addresses the seco... Jun 1 1991   Improving Quicksort Performance with a Codeword Data Structure Baer J., Lin Y. IEEE Transactions on Software Engineering 15(5): 622-631, 1989.  Type: Article In this paper the authors introduce a new data structure called CODEWORD, based on a similar structure used for microcoding selection sort in some IBM high-end mainframes. The definition of CODEWORD is as follows: let K and Q... Sep 1 1990   An Analytic/Empirical Study of Distributed Sorting on a Local Area Network Luk W., Ling F. IEEE Transactions on Software Engineering 15(5): 575-586, 1989.  Type: Article The authors of this paper present a new model for the behavior of algorithms in a local area network (LAN), analyze different distributed sorting algorithms abstractly under this model, and finally, implement those algorithms and exami... Jul 1 1990   An adaptation of a root finding method to searching ordered disk files Armenakis A., Garey L., Gupta R. BIT 25(4): 562-568, 1985.  Type: Article Three methods of locating a record in a static, ordered file are compared under different assumptions about the statistical distribution from which the keys are drawn. The methods, specifically, are the interpolation search by Perl et ... Mar 1 1987       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy