Narrow your search

Library

KU Leuven (10)

UAntwerpen (5)

VUB (4)

KBR (3)

National Bank of Belgium (3)

UGent (3)

UHasselt (3)

ULiège (3)

UCLouvain (2)

ULB (2)

More...

Resource type

book (10)

digital (1)


Language

English (9)

Dutch (1)


Year
From To Submit

1990 (10)

Listing 1 - 10 of 10
Sort by

Book
State space modeling of time series (2nd edition)
Author:
ISBN: 0387528695 0387528709 3540528695 3540528709 3642758835 9780387528694 9783540528692 Year: 1990 Publisher: Berlin ; New York, NY : Springer-Verlag,

Applied nonparametric regression
Author:
ISBN: 0521382483 0521429501 1139052136 9780521382489 9780521429504 9781139052139 Year: 1990 Volume: 19 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Applied Nonparametric Regression is the first book to bring together in one place the techniques for regression curve smoothing involving more than one variable. The computer and the development of interactive graphics programs have made curve estimation possible. This volume focuses on the applications and practical problems of two central aspects of curve smoothing: the choice of smoothing parameters and the construction of confidence bounds. Härdle argues that all smoothing methods are based on a local averaging mechanism and can be seen as essentially equivalent to kernel smoothing. To simplify the exposition, kernel smoothers are introduced and discussed in great detail. Building on this exposition, various other smoothing methods (among them splines and orthogonal polynomials) are presented and their merits discussed. All the methods presented can be understood on an intuitive level; however, exercises and supplemental materials are provided for those readers desiring a deeper understanding of the techniques. The methods covered in this text have numerous applications in many areas using statistical analysis. Examples are drawn from economics as well as from other disciplines including medicine and engineering.

SWAT 90. 2nd Scandinavian workshop on algorithm theory
Authors: ---
ISBN: 3540528466 0387528466 3540471642 Year: 1990 Volume: vol 447 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.

Keywords

681.3*G3 --- Algorithms --- -Computational complexity --- -681.3*E1 --- 681.3*F1 --- 681.3*F2 --- 681.3*G2 --- Complexity, Computational --- Electronic data processing --- Machine theory --- Algorism --- Algebra --- Arithmetic --- Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- Congresses --- Data structures: arrays; graphs; lists; tables; trees --- Computation by abstract devices --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Discrete mathematics (Mathematics of computing) --- Foundations --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F1 Computation by abstract devices --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- 681.3*G3 Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- Computational complexity --- Algorithms - Congresses. --- Computational complexity - Congresses. --- Information theory. --- Data structures (Computer scienc. --- Computer science --- Computer software. --- Computer science. --- Combinatorics. --- Theory of Computation. --- Data Structures. --- Computational Mathematics and Numerical Analysis. --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Mathematics. --- Combinatorics --- Mathematical analysis --- Informatics --- Science --- Software, Computer --- Computer systems --- Computer mathematics --- Mathematics --- Communication theory --- Communication --- Cybernetics --- -Congresses

Algorithms. International symposium SIGAL'90, Tokyo, Japan, August 16-18, 1990. Proceedings
Authors: --- --- ---
ISBN: 3540529217 3540471774 Year: 1990 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.

Keywords

681.3*G3 --- 681.3*H3 --- Algorithms --- -681.3*F1 --- 681.3*F2 --- 681.3*G2 --- Algorism --- Algebra --- Arithmetic --- Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- Information storage and retrieval. Cd-rom --- Congresses --- Computation by abstract devices --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Discrete mathematics (Mathematics of computing) --- Foundations --- Congresses. --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F1 Computation by abstract devices --- 681.3*H3 Information storage and retrieval. Cd-rom --- 681.3*G3 Probability and statistics: probabilistic algorithms (including Monte Carlo);random number generation; statistical computing; statistical software (Mathematics of computing) --- 681.3*F1 --- Information theory. --- Computer engineering. --- Operations research. --- Computer software. --- Computer science. --- Combinatorics. --- Theory of Computation. --- Electrical Engineering. --- Operations Research/Decision Theory. --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Combinatorics --- Mathematical analysis --- Informatics --- Science --- Software, Computer --- Computer systems --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Computers --- Communication theory --- Communication --- Cybernetics --- Design and construction

Listing 1 - 10 of 10
Sort by