Sciweavers

3096 search results - page 394 / 620
» Theory and Use of the EM Algorithm
Sort
View
HUC
2010
Springer
15 years 7 months ago
Goal-driven opportunistic sensing
Opportunistic activity and context recognition systems do not presume a static sensor infrastructure that is defined at the design time of a system. They also do not have a fixed ...
Marc Kurz
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 7 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
SPAA
2010
ACM
15 years 6 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
AUTOMATICA
2008
107views more  AUTOMATICA 2008»
15 years 6 months ago
Kalman filters in non-uniformly sampled multirate systems: For FDI and beyond
This paper consists of two parts. The first part is the development of a datadriven Kalman filter for a non-uniformly sampled multirate (NUSM) system, including identification of ...
Weihua Li, Sirish L. Shah, Deyun Xiao
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Bit-size estimates for triangular sets in positive dimension
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bo...
Xavier Dahan, Abdulilah Kadri, Éric Schost