Background
Vitter, Jeffrey Scott was born on November 13, 1955 in New Orleans. Son of Albert Leopold Junior and Audrey Malvina (St. Raymond) Vitter.
(Video compression is the enabling technology behind many ...)
Video compression is the enabling technology behind many cutting-edge business and Internet applications, including video-conferencing, video-on-demand, and digital cable TV. Coauthored by internationally recognized authorities on the subject, this book takes a close look at the essential tools of video compression, exploring some of the most promising algorithms for converting raw data to a compressed form.
http://www.amazon.com/gp/product/0471379425/?tag=2022091-20
http://www.amazon.com/gp/product/B00KL6GACU/?tag=2022091-20
http://www.amazon.com/gp/product/B00AVGOAZY/?tag=2022091-20
(We are especially proud to announce the publication of th...)
We are especially proud to announce the publication of this ""DIMACS"" book - the 50th volume in this series, published by the AMS. The series was established out of a collaborative venture geared to unite the cutting-edge research at DIMACS with the resources at the AMS to produce useful, well-designed, important mathematical and computational sciences works. This volume is a hallmark in this firmly grounded and well-received AMS series. The AMS' 50th ""DIMACS"" volume is also particularly notable at this time: The year 1999 marks the 10th anniversary of the founding of DIMACS as a center. Participants in the DIMACS national research project are Rutgers University, Princeton University, AT&T Labs-Research, Bell Labs (Lucent Technologies), Telcordia Technologies, and NEC Research Institute.The success of the joint publishing venture between the AMS and DIMACS is excellent. We continue to work concordantly with the Center to further their goal of playing a key national leadership role in the development, application, and dissemination of discrete mathematics and theoretical computer science. This 50th ""DIMACS"" volume is in celebration of that dynamic, ongoing partnership. About the book: special techniques from computer science and mathematics are used to solve combinatorial problems whose associated data require a hierarchy of storage devices. These solutions employ 'extended memory algorithms'. The input/output (I/O) communication between the levels of the hierarchy is often a significant bottleneck, especially in applications that process massive amounts of data. Gains in performance are possible by incorporating locality directly into the algorithms and managing the contents of each storage level.The relative difference in data access speeds is more apparent between random access memory and magnetic disks. Therefore, much research has been devoted to algorithms that focus on this I/O bottleneck. These algorithms are usually called 'external memory', 'out-of-core', or 'I/O algorithms'.This volume presents new research results and current techniques for the design and analysis of external memory algorithms. The articles grew out of the workshop, 'External Memory Algorithms and Visualization' held at DIMACS. Leading researchers were invited to give lectures and to contribute their work. The topics presented include problems in computational geometry, graph theory, data compression, disk scheduling, linear algebra, statistics, software libraries, text and string processing, visualization, wavelets, and industrial applications. The vitality of the research and the interdisciplinary nature of the event produced fruitful ground for the compelling fusion of ideas and methods. This volume comprises the rich results that grew out of that process.
http://www.amazon.com/gp/product/0821811843/?tag=2022091-20
(Data sets in large applications are often too massive to ...)
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality and parallelism in order to reduce the I/O costs. A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory. Algorithms and Data Structures for External Memory describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. Algorithms and Data Structures for External Memory is an invaluable reference for anybody interested in, or conducting research in the design, analysis, and implementation of algorithms and data structures.
http://www.amazon.com/gp/product/1601981066/?tag=2022091-20
(Hashing, a commonly used technique for arranging data to ...)
Hashing, a commonly used technique for arranging data to facilitate rapid searches, is discussed from several different perspectives as an efficient solution to the classical problem of information storage and retrieval. The underlying theme is close cooperation between the analysis of algorithms and the computer world. To increase the work's accessibility to computer scientists, algorithms are given both in English and in a variant of the well-known language Pascal. Designed to appeal to as wide an audience as possible, this book serves both as a graduate text in analysis of algorithms and as a professional reference for computer scientists and programmers.
http://www.amazon.com/gp/product/0195041828/?tag=2022091-20
academic administrator researcher science educator
Vitter, Jeffrey Scott was born on November 13, 1955 in New Orleans. Son of Albert Leopold Junior and Audrey Malvina (St. Raymond) Vitter.
Bachelor of Science in Mathematics with highest honors, University Notre Dame, 1977. Doctor of Philosophy in Computer Science, Stanford University, 1980. AM (honorary), Brown University, 1986.
Master of Business Administration, Duke University, 2002.
Assistant computer performance analyst Standard Oil Corporation California, San Francisco, 1976—1977. Research and teaching assistant Stanford (California) University, 1977—1980, teaching fellow, 1979. Assistant professor computer science Brown University, Providence, 1980—1985, associate professor computer science, 1985—1988, professor computer science, 1988—1993.
Gilbert, Louis and Edward Lehrman professor computer science Duke University, Durham, North Carolina, 1993—2002, chairman department, 1993—2001, co-director Center for Geometric and Biological Computing, 1997—2002. Professor computer science Purdue University, 2002—2008, Frederick L. Hovde dean College of Science, 2002—2008. Provost and executive vice president academies Texas Agricultural and Mechanical University, College Station, since 2008, professor computer science and engineering, since 2008.
Consultant International Business Machines Corporation, 1981-1986, Institute for Defense Analyses, 1986, Center for Computing Sciences, 1992-1994, Lucent Technologies, Bell Laboratories, 1997. Member research staff Mathematics Sciences Research Institute, Berkeley, 1986, Institute Recherche en Informatique et en Automatique, Roquencourt, France, 1986-1987, Institute Recherche en Informatique et en Automatique, Sophia Antipolis, France, 1998-1999. Visiting professor Ecole Normale Superieure, Paris, 1986-1989.
Visiting and adjunct professor Tulane University, 1990-2006, member board advisors School of Science and Engineering, since 2006. Lecturer Asian School on Computer Science, Bangkok, 1987. Associate member Center Excellence in Space Data and Information Sciences.
(Hashing, a commonly used technique for arranging data to ...)
(Video compression is the enabling technology behind many ...)
(We are especially proud to announce the publication of th...)
(Data sets in large applications are often too massive to ...)
Fellow Institute of Electrical and Electronics Engineers (editor transactions on Computers 1985, 87-91), Association for Computing Machinery (editor Communications 1988-1995, Journal Experimental Algorithmics, 2000. Member-at-large special interest group on automata and computability theory 1987-1991, vice chair special interest group on algorithms and computation theory 1991-1997, chair 1997-2001, executive committee 2001-2005, Recognition of Service award 1997, 2001). Member Computing Research Association (board directors since 2000, co-chair government affairs committee since 2001), Phi Beta Kappa, Sigma Xi.
Married Sharon Louise Weaver, August 14, 1982. Children: Jillian St. Raymond, J. Scott Junior, Audrey Louise.