Sciweavers

5275 search results - page 324 / 1055
» Computing by observing
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 4 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 4 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
141
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
ECCC
2008
108views more  ECCC 2008»
15 years 4 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
CVIU
2006
110views more  CVIU 2006»
15 years 4 months ago
Matching actions in presence of camera motion
When the camera viewing an action is moving, the motion observed in the video not only contains the motion of the actor but also the motion of the camera. At each time instant, in...
Alper Yilmaz, Mubarak Shah