Sciweavers

1039 search results - page 153 / 208
» networks 1998
Sort
View
JSA
1998
74views more  JSA 1998»
13 years 8 months ago
Windowed active sampling for reliable neural learning
The composition of the example set has a major impact on the quality of neural learning. The popular approach is focused on extensive preprocessing to bridge the representation ga...
Emilia I. Barakova, Lambert Spaanenburg
ML
1998
ACM
102views Machine Learning» more  ML 1998»
13 years 8 months ago
Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
Renato Vicente, Osame Kinouchi, Nestor Caticha
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 8 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
TCS
1998
13 years 8 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran
TNN
1998
100views more  TNN 1998»
13 years 8 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada