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 .
Distinguished Professors at the University of Kansas: Recent submissions
Now showing items 541-560 of 918
-
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
(Springer Verlag, 1996-09)In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing I/O communication. Geographical information systems (GIS) are good examples of such large-scale applications ... -
Efficient Bulk Operations on Dynamic R-trees
(Springer Verlag, 2002-12)In recent years, there has been an upsurge of interest in spatial databases. A major issue is how to efficiently manipulate massive amounts of spatial data stored on disk in multidimensional spatial indexes (data structures). ... -
Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments
(Springer Verlag, 1999-01)In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can rent the resource for $1 per unit time or ... -
CAMEL: Concept Annotated iMagE Libraries
(SPIE--The International Society for Optical Engineering, 2001-01)The problem of content-based image searching has received considerable attention in the last few years. Thousands of images are now available on the internet, andmany important applications require searching of images in ... -
Constrained Querying of Multimedia Databases
(SPIE--The International Society for Optical Engineering, 2001-01)This paper investigates the problem of high-level querying of multimedia data by imposing arbitrary domain-specific constraints among multimedia objects. We argue that the current structured query mode, and the query-by-content ... -
Fast Progressive Lossless Image Compression
(SPIE--The International Society for Optical Engineering, 1994-02)We present a method for progressive lossless compression of still grayscale images that combines the speed of our earlier FELICS method with the progressivity of our earlier MLP method We use MLP s pyramid based pixel ... -
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform (Extended Abstract)
(Society for Industrial and Applied Mathematics, 2008-01)In this paper, we present a nearly tight analysis of the encoding length of the Burrows-Wheeler Transform (bwt) that is motivated by the text indexing setting.For a text T of n symbols drawn from an alphabet , our encoding ... -
High-Order Entropy-Compressed Text Indexes
(Society for Industrial and Applied Mathematics Philadelphia, 2003)We present a novel implementation of compressed su~x arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet E, where each symbol is encoded by ... -
Theory and Practice of I/O efficient Algorithms for Multidimensional Batched Searching Problems
(Society for Industrial and Applied Mathematics, 1998)We describe a powerful framework for designing efficient batch algorithms for certain large-scale dynamic problems that must be solved using external memory. The class of problems we consider, which we call colorable ... -
I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking
(Society for Industrial and Applied Mathematics, 1998)For a polyhedral terrain C, the contour at z-coordinate h, denoted Ch, is defined to be the intersection of the plane z = h with C. In this paper, we study the contour-line extraction problem, where we want to preprocess ... -
Creditor Claims in Arbitration and in Court
(UC Hastings College of the Law, 2011)This Interim Report builds on the Preliminary Report, Consumer Arbitration Before the American Arbitration Association, issued in March 2009 by the Searle Civil Justice Institute's Consumer Arbitration Task Force. It seeks ... -
External-Memory Graph Algorithms
(Society for Industrial and Applied Mathematics, 1995)We present a collection of new techniques for designing and analyzing efficient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our ... -
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, ...
