Sciweavers

TNN
1998
89views more  TNN 1998»
13 years 9 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
TNN
1998
111views more  TNN 1998»
13 years 9 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
TNN
1998
94views more  TNN 1998»
13 years 9 months ago
Global convergence of Oja's subspace algorithm for principal component extraction
—Oja’s principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the conve...
Tianping Chen, Yingbo Hua, Wei-Yong Yan
TKDE
1998
142views more  TKDE 1998»
13 years 9 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...
SIGIR
2002
ACM
13 years 9 months ago
Study of category score algorithms for k-NN classifier
: This paper analyzes category score algorithms for k-NN classifier found in the literature, including majority voting algorithm (MVA), simple sum algorithm (SSA), etc. MVA and SS...
Huaizhong Kou, Georges Gardarin
SIGCSE
2002
ACM
172views Education» more  SIGCSE 2002»
13 years 9 months ago
Simulation of load balancing algorithms: a comparative study
This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round rob...
Milan E. Soklic
SIAMJO
2002
89views more  SIAMJO 2002»
13 years 9 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 9 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 9 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 9 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...