Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Sorting And Searching (F.2.2...)  
 
Options:
 
  1-10 of 83 Reviews about "Sorting And Searching (F.2.2...)": Date Reviewed
  Estimating the subsystem reliability of bubblesort networks
Kung T., Hung C. Theoretical Computer Science 67045-55, 2017.  Type: Article

A bubblesort network consists of nodes labeled with permutations of characters, so that two nodes have a direct connection when their corresponding permutations differ by the interchange of two adjacent characters. A multiprocessor sys...

Jun 2 2017
  B-trees and cache-oblivious B-trees with different-sized atomic keys
Bender M., Ebrahimi R., Hu H., Kuszmaul B. ACM Transactions on Database Systems 41(3): 1-33, 2016.  Type: Article

The problem of creating B-tree-like dictionaries with small atomic keys from a system containing large, variable-size records is the subject of this paper. These kinds of dictionaries provide guaranteed performance, enhancing the searc...

Sep 13 2016
  Methods for finding frequent items in data streams
Cormode G., Hadjieleftheriou M. The VLDB Journal: The International Journal on Very Large Data Bases 19(1): 3-20, 2010.  Type: Article

A large class of real-world applications, with a tight relation to large-scale industrial systems, requires the processing of data that arrives in the form of streams. Data stream mining is a challenging research problem due to the hig...

Aug 10 2010
  A simplified derivation of timing complexity lower bounds for sorting by comparisons
Schellekens M., Agarwal R., Popovici E., Man K. Nordic Journal of Computing 13(4): 340-346, 2006.  Type: Article

A comparison-based sorting of n numbers needs a minimum of roughly n log n operations. This paper presents a new derivation for this famous computer science fact. While, for the ...

Feb 28 2008
  Efficient methods on predictions for similarity search over stream time series
Lian X., Chen L.  Scientific and statistical database management (Proceedings of the 18th International Conference on Scientific and Statistical Database Management,Jul 3-Jul 5, 2006) 241-250, 2006.  Type: Proceedings

While similarity search has been studied thoroughly for archived time series data, the problem has not been investigated for the case where future time series values are not yet available. The support of similarity search for future da...

Mar 8 2007
  Distribution sort with randomized cycle
Vitter J., Hutchinson D.  Discrete algorithms (Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, D.C, Jan 7-9, 2001) 77-86, 2001.  Type: Proceedings

Efficiently managing parallel resources is the natural and, with the disappearance of Moore’s Law, possibly the only way to increase the computational power of computing systems. Since disk access is slow, this predicamen...

Jul 25 2006
  Binary queries for document trees
Berlea A., Seidl H. Nordic Journal of Computing 11(1): 41-71, 2004.  Type: Article

In an Extensible Markup Language (XML) application, it may be necessary to simultaneously locate a k-tuple of nodes in an input (XML) tree that satisfies some given relationship. The difficulty here is that it is necessary to maintain ...

Dec 21 2004
  Sorting algorithms for broadcast communications: mathematical analysis
Grabner P., Prodinger H. Theoretical Computer Science 289(1): 51-67, 2002.  Type: Article

The use of distributed databases and Internet communication has many of the features of parallel processing, so can be expected to yield faster algorithms for problems than those yielded by serial computation. The authors have analyzed...

Jul 22 2003
  Efficient time-series subsequence matching using duality in constructing windows
Moon Y., Whang K., Loh W. Information Systems 26(4): 279-293, 2001.  Type: Article

Subsequence matching is a problem where, for given N data sequences of varying lengths, a query sequence Q, and a number representing the tolerance, one must find those sequences one or more subse...

Jan 13 2003
  How good is the factor concept in estimating the average number of character comparisons per item in string sorting?
Mustafa S., Masoud F. Journal of Systems and Software 57(3): 221-226, 2001.  Type: Article

For decades, sorting has been a popular topic. Sorting strings, however, has attracted less attention than sorting numbers. In particular, there have not been many metrics proposed to assist in the analysis of string sorting. Previous...

Oct 29 2002
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy