Narrow your search

Library

KBR (15)

ULiège (9)

KU Leuven (8)

UCLouvain (8)

UGent (7)

ULB (6)

UAntwerpen (4)

VUB (4)

UHasselt (3)

UMons (1)

More...

Resource type

book (15)


Language

English (15)


Year
From To Submit

1998 (3)

1996 (3)

1995 (1)

1993 (1)

1992 (7)

Listing 1 - 10 of 15 << page
of 2
>>
Sort by
Algorithmics: the spirit of computing
Author:
ISBN: 0201504014 Year: 1992 Publisher: Reading Addison-Wesley

Loading...
Export citation

Choose an application

Bookmark

Abstract

Parallel numerical algorithms
Authors: ---
ISBN: 0136515975 9780136515975 Year: 1992 Publisher: New York Prentice Hall

Pattern-recognition transforms
Author:
ISBN: 0863801374 0471936332 Year: 1992 Volume: 4 Publisher: Taunton New York ; Chichester ; Toronto Research Studies Press Wiley

Algorithmic learning for knowledge besed systems. GOSLER final report
Authors: ---
ISBN: 3540602178 3540447377 9783540602170 Year: 1995 Volume: 961 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book is the final report on a comprehensive basic research project, named GOSLER on algorithmic learning for knowledge-based systems supported by the German Federal Ministry of Research and Technology during the years 1991 - 1994. This research effort was focused on the study of fundamental learnability problems integrating theoretical research with the development of tools and experimental investigation. The contributions by 11 participants in the GOSLER project is complemented by contributions from 23 researchers from abroad. Thus the volume provides a competent introduction to algorithmic learning theory.

Bounded incremental computation
Author:
ISBN: 354061320X 3540684581 9783540613206 Year: 1996 Volume: 1089 Publisher: Berlin [etc.] : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.

Design of hashing algorithms
Authors: ---
ISBN: 3540575006 0387575006 3540481982 Year: 1993 Volume: 756 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms were first used for sear- ching records in databases; they are central for digital si- gnature applications and are used for authentication without secrecy. Covering all practical and theoretical issues related to the design of secure hashing algorithms the book is self contained; it includes an extensive bibliography on the topic.

Times structures : formal description and algorithmic representation
Author:
ISBN: 3540609415 3540497463 9783540609414 Year: 1996 Volume: 1047 Publisher: Berlin [etc.] : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The notion of time plays an important role in modern science. In computer science and artificial intelligence, the parameter of time is of particular importance, e.g. for planning robot activity, natural language processing, and time-varying scene analysis. This work investigates the relationship between classic, first-order theories of point- and interval-based time structures, modal logics of corresponding structures, and their algorithmic representations. To make this relationship complete, a formalisation of Allen's famous algorithm, applicable to various structures of time, is presented along with its translation to modal logics. All in all, the book is a competent and comprehensive analysis of logical descriptions and algorithmic representations of time structures.

Genetic algorithms and data structures are evolution programs
Author:
ISBN: 3540553878 0387553878 3662028328 3662028301 9783540553878 Year: 1992 Publisher: Berlin Springer

Data structures and efficient algorithms : final report on the DFG special joint initiative
Authors: ---
ISBN: 3540554882 3540471030 Year: 1992 Volume: vol 594 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems.

Listing 1 - 10 of 15 << page
of 2
>>
Sort by