Sciweavers

5275 search results - page 46 / 1055
» Computing by observing
Sort
View
TASLP
2011
14 years 9 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
15 years 8 months ago
An optimal filtering algorithm for non-parametric observation models in robot localization
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
Jose-Luis Blanco, Javier Gonzalez, Juan-Antonio Fe...
ICMCS
2006
IEEE
167views Multimedia» more  ICMCS 2006»
15 years 8 months ago
Efficient Object Tracking using Control-Based Observer Design
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
Wei Qu, Dan Schonfeld
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 6 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
ICCAD
1995
IEEE
180views Hardware» more  ICCAD 1995»
15 years 5 months ago
Design based analog testing by Characteristic Observation Inference
In this paper, a new approach to analog test design based on the circuit design process, called Characteristic Observation Inference (COI), is presented. In many situations, it is...
Walter M. Lindermeir, Helmut E. Graeb, Kurt Antrei...