Sciweavers

132 search results - page 23 / 27
» Relational Partially Observable MDPs
Sort
View
HPCA
2009
IEEE
14 years 10 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 2 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
CCE
2007
13 years 9 months ago
A systematic approach for soft sensor development
This paper presents a systematic approach based on robust statistical techniques for development of a data-driven soft sensor, which is an important component of the process analy...
Bao Lin, Bodil Recke, Jørgen K. H. Knudsen,...
JCB
2007
198views more  JCB 2007»
13 years 9 months ago
Bayesian Hierarchical Model for Large-Scale Covariance Matrix Estimation
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
Dongxiao Zhu, Alfred O. Hero III
MSCS
2007
125views more  MSCS 2007»
13 years 9 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym