Sciweavers

14161 search results - page 362 / 2833
» On generalized middle-level problem
Sort
View
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
15 years 6 months ago
Commutation in Global Supermonoid of Free Monoids
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
Anna Brosalina, Boris Melnikov
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 6 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
IJON
2002
103views more  IJON 2002»
15 years 6 months ago
RBF networks training using a dual extended Kalman filter
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
Iulian B. Ciocoiu
COR
1999
110views more  COR 1999»
15 years 6 months ago
Economics of location: A selective survey
We present a selective survey of the main results obtained in spatial economic theory. Our focus is on "rm location. We start with the simplest location problem and proceed t...
Maureen Kilkenny, Jacques-François Thisse