• Publications
  • Influence
Approximation by superpositions of a sigmoidal function
  • G. Cybenko
  • Mathematics, Computer Science
  • Math. Control. Signals Syst.
  • 1 December 1989
TLDR
In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set of affine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube. Expand
  • 4,160
  • 188
  • PDF
Dynamic Load Balancing for Distributed Memory Multiprocessors
  • G. Cybenko
  • Computer Science
  • J. Parallel Distributed Comput.
  • 1 October 1989
TLDR
In this paper we study diffusion schemes for dynamic load balancing on message passing multiprocessor networks by explicitly computing the eigenstructure of its node adjacency matrix. Expand
  • 1,060
  • 71
  • PDF
Approximation by superpositions of a sigmoidal function
  • G. Cybenko
  • Computer Science
  • Math. Control. Signals Syst.
  • 1992
TLDR
In the paper "Approximation by Superpositions of a SigmoidaI Function" [C], the proof given for Lemma i is incorrect since it relies on the erroneous statement that simple functions are dense in L=(R). Expand
  • 4,848
  • 38
TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
  • 448
  • 30
How dynamic is the Web?
TLDR
This paper describes preliminary data on and statistical analysis of the frequency and nature of Web page modifications. Expand
  • 355
  • 23
  • PDF
Tracking a moving object with a binary sensor network
TLDR
In this paper we examine the role of very simple and noisy sensors for the tracking problem. Expand
  • 439
  • 16
  • PDF
D'Agents: Applications and performance of a mobile‐agent system
TLDR
D'Agents is a general‐purpose mobile‐agent system that has been used in several information‐retrieval applications. Expand
  • 183
  • 14
  • PDF
Mobile agents: Motivations and state of the art
TLDR
A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. Expand
  • 200
  • 11
Keeping up with the changing Web
TLDR
This article quantifies what current means for Web search engines and estimates how often they must reindex the Web to keep current with its changing pages and structure. Expand
  • 171
  • 10
  • PDF
Computing thr minimum eigenvalue of a symmetric positive definite Toeplitz matrix
A method for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix is given. It relies solely upon the Levinson–Durbin algorithm. The procedure involves a combination ofExpand
  • 62
  • 10
...
1
2
3
4
5
...