ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Provost Office Published Articles: Recent submissions
Now showing items 81-95 of 95
-
Approximate Data Structures with Applications
(Society for Industrial and Applied Mathematics, 1994)In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in the output. Approximate data structures trade error of approximation for faster operation, leading ... -
Efficient Bundle Sorting
(Society for Industrial and Applied Mathematics, 2006)Many data sets to be sorted consist of a limited number of distinct keys. Sorting such data sets can be thought of as bundling together identical keys and having the bundles placed in order; we therefore denote this as ... -
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
(Society for Industrial and Applied Mathematics, 2005)The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as ... -
Duality Between Prefetching and Queued Writing with Parallel Disks
(Society for Industrial and Applied Mathematics, 2005)Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat this problem, we define ... -
Optimal External Memory Interval Management
(Society for Industrial and Applied Mathematics, 2003)In this paper we present the external interval tree, an optimal external memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The external interval tree can be usedin an optimal ... -
Application-Controlled Paging for a Shared Cache
(Society for Industrial and Applied Mathematics, 2000)We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to information about its own future page requests, ... -
Optimal Prediction for Prefetching in the Worst Case
(Society for Industrial and Applied Mathematics, 1998-12)Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because of their success in avoiding costly I/Os. ... -
The Maximum Size of Dynamic Data Structures
(Society for Industrial and Applied Mathematics, 1991-10)This paper develops two probabilistic methods that allow the analysis of the maximum data structure size encountered during a sequence of insertions and deletions in data structures such as priority queues, dictionaries, ... -
Parallel Transitive Closure and Point Location in Planar Structures
(Society for Industrial and Applied Mathematics, 1991-08)Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and ... -
Optimum Algorithms for a Model of Direct Chaining
(Society for Industrial and Applied Mathematics, 1985-05)Direct chaining is a popular and efficient class of hashing algorithms. In this paper we study optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after ... -
Analysis of Early-Insertion Standard Coalesced Hashing
(Society for Industrial and Applied Mathematics, 1983)This paper analyzes the early-insertion standard coalesced hashing method (EISCH), which is a variant of the standard coalesced hashing algorithm (SCH) described in [Knu73], [Vit80] and [Vit82b]. The analysis answers the ... -
I/O-efficient dynamic point location in monotone planar subdivisions
(Society for Industrial and Applied Mathematics, 1999)We present an efficient external-memory dynamic data structure for point location in monotone planar subdivisions. Our data structure uses O(N/B) disk blocks to store a monotone subdivision of size N, where B is the size ... -
Scalable mining for classification rules in relational databases
(Institute of Mathematical Statistics, 2004)Data mining is a process of discovering useful patterns (knowledge) hidden in extremely large datasets. Classification is a fundamental data mining function, and some other functions can be reduced to it. In this paper ... -
Scholarly Communications is Not Toxic Waste : Lessons Learned
(EBIB, 2004)I will address the ecology of the scholarly communications system. This conference focuses on dramatically improving the effectiveness of that system by creating "open access to knowledge." In our efforts to do so we ... -
Economics as if science mattered: the BioOne business model and the transformation of scholarly publishing
(2002-09)The BioOne database of scholarly journals in the biological and ecological sciences was established in the belief that broad and enduring access to scholarly literature is essential not just to the health of the scientific ...
