Sciweavers

7274 search results - page 173 / 1455
» Abstractions for network update
Sort
View
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
15 years 9 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
FCT
1995
Springer
15 years 9 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
ECAI
2008
Springer
15 years 7 months ago
An Ensemble of Classifiers for coping with Recurring Contexts in Data Streams
Abstract. This paper proposes a general framework for classifying data streams by exploiting incremental clustering in order to dynamically build and update an ensemble of incremen...
Ioannis Katakis, Grigorios Tsoumakas, Ioannis P. V...
ESANN
2004
15 years 7 months ago
Towards a Local Separation Performances Estimator Using Common ICA Contrast Functions?
Abstract. In most ICA algorithms, the separation performances are estimated through the evaluation of a contrast function , used in the update rule of elements of the unmixing matr...
Frédéric Vrins, Cédric Archam...
DICTA
2003
15 years 7 months ago
Adaptive Magnetic Resonance Image Denoising Using Mixture Model and Wavelet Shrinkage
Abstract. This paper proposes a new adaptive wavelet-based Magnetic Resonance images denoising algorithm. A Rician distribution for background-noise modelling is introduced and a M...
Lei Jiang, Wenhui Yang