Sciweavers

4761 search results - page 934 / 953
» Generalizing Boundary Points
Sort
View
IJON
1998
140views more  IJON 1998»
13 years 8 months ago
Comment on "Discrete-time recurrent neural network architectures: A unifying review"
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
Léon Personnaz, Gérard Dreyfus
JCT
1998
193views more  JCT 1998»
13 years 8 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 8 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 8 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
TSE
1998
116views more  TSE 1998»
13 years 8 months ago
A Framework-Based Approach to the Development of Network-Aware Applications
— Modern networks provide a QoS (quality of service) model to go beyond best-effort services, but current QoS models are oriented towards low-level network parameters (e.g., band...
Jürg Bolliger, Thomas R. Gross