Sciweavers

5948 search results - page 276 / 1190
» Computing Robust Counter-Strategies
Sort
View
ICDM
2007
IEEE
156views Data Mining» more  ICDM 2007»
15 years 8 months ago
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
Tsuyoshi Idé, Spiros Papadimitriou, Michail...
MVA
1996
129views Computer Vision» more  MVA 1996»
15 years 5 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 4 months ago
A distributed file system for a wide-area high performance computing infrastructure
We describe our work in implementing a wide-area distributed file system for the NSF TeraGrid. The system, called XUFS, allows private distributed name spaces to be created for tr...
Edward Walker
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 4 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
INFORMATICALT
1998
96views more  INFORMATICALT 1998»
15 years 4 months ago
State Estimation of Dynamic Systems in the Presence of Time-Varying Outliers in Observations
Abstract. In the previous papers (Masreliez and Martin, 1977; Novoviˇcova, 1987; Schick and Mitter, 1994) the problem of recursive estimation of linear dynamic systems parameters ...
Rimantas Pupeikis