Office of the Provost: Recent submissions
Now showing items 21-40 of 95
-
Labor's Share By Sector And Industry, 1948-1965
(Industrial and Labor Relations Review, 1971) -
Eliminating the Scholarly Communication Crisis: From Here to Near
(Merrill Center, 1999) -
The State of Research Endeavors: View from the Campus-Wide Leadership Level
(Merrill Center, 1997) -
Impacts of Openness
(2013-10-25)This event brings together several speakers from a variety of fields, each of whom will give a 10-minute presentation about the impact of openness in their work. More information about this event is available at ... -
On Scholarly Evaluation and Scholarly Communication
(ACRL Publications, 2001) -
Moving With Dispatch to Resolve the Scholarly Communication Crisis: From Here to NEAR
(Association of Research Libraries, 1999) -
University Research Publishing or Distribution Strategies?
(Association of Research Libraries, 2007) -
The Future of the U.S. Research University
(Association of Research Libraries, 2011) -
University Public-Access Mandates Are Good for Science
(Public Library of Science, 2009) -
Compressed Index for Dictionary Matching with One Error
(Institute of Electrical and Electronics Engineers, 2011-03-29)Given a set D of d patterns of total length n, the dictionary matching problem is to index D such that for any query text T, we can locate the occurrences of any pattern within T efficiently. This problem can be solved in ... -
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 ...