Baeza-Yates / Manber Computer Science

Research and Applications
Erscheinungsjahr 2012
ISBN: 978-1-4615-3422-8
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 488 Seiten, eBook

Zielgruppe

Research

Autoren/Hrsg.

Baeza-Yates, Ricardo

Manber, U.

Inhaltsverzeichnis

Historical Overview.- Office Information Systems Engineering.- Update Languages vs. Query Languages.- OPUS: An Extensible Optimizer for Up-to-Date Database Systems.- A Hyperlcon Interface to a Blackboard System for Planning Research Projects.- Chusaurus: A Writing Tool Resource for Non-Native Users of English.- Trends in Representing the Semantics of Natural Language Sentences: A Comparative Study.- Extending Partial Evaluation in Logic Programming.- Modules, Macros and Lisp.- Using Filters to Improve the Efficiency of Game-Playing Learning Procedures.- An O(n2.5) Time Heuristic Algorithm for a Class of Large Weighted Edge Colouring Problem.- Randomized Sorting of Shuffled Monotone Sequences.- A Classification of Quadratic Algorithms for Multiplying Polynomials of Small Degree Over Finite Fields.- An Algorithm for Computing Multivariate Polynomial Resultants.- New Absorbing and Ergodic Doubly-Linked List Reorganizing Heuristics.- Skip Sort-An Adaptive Randomized Algorithm or Expected Time Adaptivity is Best.- Data Structures and Access Methods for Read-Only Optical Disks.- Mixed-Radix Huffman Codes.- A Schema Manipulation Mechanism for an OODB Model.- Versions in the Context of Object-Oriented Database Systems.- Ddraw: An Object-Oriented Design Tool.- A Graphical Interactive Object-Oriented Development System.- A Concurrent Object-Oriented Paradigm for Attribute Grammars.- Preserving Distributed Data Coherence Using Asynchronous Broadcasts.- An Implementation of Service Rebalancing.- Bit Optimal Distributed Consensus.- An Efficient Distributed Termination.- Allocating Modules to Processors in a Distributed System with Limited Memory.- The Complexity of Algorithmic Problems on Succint Instances (Invited paper.- Parallel Algorithms for NP-Complete Problems (Invited paper.- Parallel Search in Sorted Multisets, and NP-Complete Problems.- Towards Understanding the Effective Parallelization of Sequential Algorithms.- On the Density of the Probabilistic Polynomial Classes.- Modelling and Simulation of a Pseudosystolic Processor for Matrix Algorithms.- The Caracas Multiprocessor System.- A New Communication Systems Architecture Supporting Migration to OSI.- Modelling and Analysis of Time Critical Applications on Local Area Networks.- Matrix Multiplication on Digital Signal Processors and Hierarchical Memory Systems.- Author Index.