Sciweavers

1957 search results - page 55 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
14 years 4 months ago
An adaptive-covariance-rank algorithm for the unscented Kalman filter
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...
Lauren E. Padilla, Clarence W. Rowley
EDBT
2008
ACM
135views Database» more  EDBT 2008»
15 years 9 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 9 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SPLC
2008
14 years 11 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
ICA
2012
Springer
13 years 5 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...