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 501-520 of 918
-
Cultured Brain Microvessel Endothelial Cells as In Vitro Models of the Blood-Brain Barrier
(National Institutes of Health, 1992) -
Revolution vs. Devolution in Kansas: Teaching in a Conservative Climate
(Teaching Philosophy, 2007) -
Missionary Positions
(Wiley-Blackwell, 2005)Postcolonial feminist scholars have described some Western feminist activism as imperialistic, drawing a comparison to the work of Christian missionaries from the West, who aided in the project of colonization and assimilation ... -
Nearly Optimal Vector Quantization via Linear Programming
(IEEE, 1992)We present new vector quantization algorithms based on the theory devel- oped in [LiV]. The new approach is to formulate a vector quantization problem as a 0-1 integer linear program. We rst solve its relaxed linear program ... -
Online Perfect Matching and Mobile Computing
(Springer Verlag, 1995)We present a natural online perfect matching problem moti- vated by problems in mobile computing. A total of n customers connect and disconnect sequentially, and each customer has an associated set of stations to which it ... -
Faster Compressed Dictionary Matching (extended abstract)
(Springer Verlag, 2010)The past few years have witnessed several exciting results on compressed represen- tation of a string T that supports e±cient pattern matching, and the space complexity has been reduced to jTjHk(T)+o(jTj log ¾) bits [8, ... -
I/O-efficient Compressed Text Indexes: From Theory to Practice (extended abstract)
(IEEE, 2010)Pattern matching on text data has been a fundamental field of Computer Science for nearly 40 years. Databases supporting full-text indexing functionality on text data are now widely used by biologists. In the theoretical ... -
Space-Efficient Framework for Top-k String Retrieval Problems (extended abstract)
(IEEE, 2009)Given a set D = fd1; d2; -
Compressed Index for Dictionary Matching (extended abstract)
(IEEE, 2008)The past few years have witnessed several exciting results on compressed represen- tation of a string T that supports e±cient pattern matching, and the space complexity has been reduced to jTjHk(T)+o(jTj log ¾) bits [8, ... -
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing (extended abstract)
(IEEE, 2008)We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT converts the text into a set of points in ... -
A Framework for Dynamizing Succinct Data Structures (Extended Abstract)
(Springer Verlag, 2007)We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most stateof- the-art succinct ... -
Arithmetic Coding for Data Compression
(IEEE, 1994)Arithmetic coding provides an e ective mechanism for remov- ing redundancy in the encoding of data. We show how arithmetic coding works and describe an e cient implementation that uses table lookup as a fast alternative ... -
A Unified Approach for Indexed and Non-Indexed Spatial Joins
(Springer Verlag, 2000)L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J. S. Vitter. “A Unified Approach for Indexed and Non-Indexed Spatial Joins,” Proceedings of the 7th International Conference on Extending Database Technology ... -
Online Data Structures in External Memory
(Springer Verlag, 1999)The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices such as disks. A major performance bottleneck can be ... -
Constructing Binary Space Partitions for Orthogonal Rectangles in Practice
(Springer Verlag, 1998)In this paper, we develop a simple technique for constructing a I3inary Space Partition (nSP) for a set of orthogonal rectangles in IR3. OUf algorithm has the novel feature that it tunes its performance to the geometric ... -
Efficient Update of Indexes for Dynamically Changing Web Documents
(Springer Verlag, 2007)Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchronized collection is not immediately searchable, ... -
Dynamic Generation of Discrete Random Variates
(Springer Verlag, 2003)We present and analyze efficient new algorithms for generating a random variate distributed according to a dynamically changing set of N weights. The base version of each algorithm generates the discrete random variate in ... -
A Simple and Efficient Parallel Disk Mergesort
(Springer Verlag, 2002)External sorting|the process of sorting a le that is too large to t into the computer's internal memory and must be stored externally on disks|is a fundamental subroutine in database sys- tems [Gra93, IBM90]. Of prime ... -
Compressed Data Structures: Dictionaries and the Data-Aware Measures
(Elsevier, 2007-11-22)We propose measures for compressed data structures, in which space usage is mea- sured in a data-aware manner. In particular, we consider the fundamental dictionary problem on set data, where the task is to construct a ... -
External-Memory Computational Geometry
(IEEE, 1993)In this paper we give new techniques for designing e cient algorithms for computational geometry prob- lems that are too large to be solved in internal mem- ory. We use these techniques to develop optimal and practical ...
