Sciweavers

3553 search results - page 551 / 711
» Association Computation for Information Access
Sort
View
PAMI
2006
164views more  PAMI 2006»
15 years 6 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
SIGPRO
2008
136views more  SIGPRO 2008»
15 years 6 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...
TNN
2008
138views more  TNN 2008»
15 years 6 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
TNN
2008
132views more  TNN 2008»
15 years 6 months ago
Just-in-Time Adaptive Classifiers - Part I: Detecting Nonstationary Changes
Abstract--The stationarity requirement for the process generating the data is a common assumption in classifiers' design. When such hypothesis does not hold, e.g., in applicat...
Cesare Alippi, Manuel Roveri
AI
2000
Springer
15 years 6 months ago
Understanding dynamic scenes
We propose a framework for the representation of visual knowledge in a robotic agent, with special attention to the understanding of dynamic scenes. According to our approach, und...
Antonio Chella, Marcello Frixione, Salvatore Gagli...