Sciweavers

5169 search results - page 612 / 1034
» Locality approximation using time
Sort
View
ESANN
2006
15 years 8 months ago
Unsupervised clustering of continuous trajectories of kinematic trees with SOM-SD
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
Jochen J. Steil, Risto Koiva, Alessandro Sperduti
IASTEDSE
2004
15 years 8 months ago
A coordination architecture for time-dependent components
The integration of distributed, data dependent components requires a data synchronisation model. We consider a class of systems where data-dependent components produce data in dis...
Michael N. Barth, Alexander Knapp
NIPS
1993
15 years 8 months ago
Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
Justin A. Boyan, Michael L. Littman
ICASSP
2011
IEEE
14 years 10 months ago
A hierarchical static-dynamic framework for emotion classification
The goal of emotion classification is to estimate an emotion label, given representative data and discriminative features. Humans are very good at deriving high-level representat...
Emily Mower, Shrikanth Narayanan
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 7 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu