424 search results - page 19 / 85 » Realizability models and implicit complexity |
BMCBI
2010
13 years 2 months ago
2010
Background: We suggest a new type of modeling approach for the coarse grained, particle-based spatial simulation of combinatorially complex chemical reaction systems. In our appro...
24
Voted
ISSS
1998
IEEE
13 years 11 months ago
1998
IEEE
The concept of retargetability enables compiler technology to keep pace with the increasing variety of domain-speci c embedded processors. In order to achieve user retargetability,...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
A novel particle filter, the Memory-based Particle Filter
(M-PF), is proposed that can visually track moving objects
that have complex dynamics. We aim to realize robustness
aga...
JMLR
2010
13 years 2 months ago
2010
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...