Sciweavers

4036 search results - page 756 / 808
» Formal Methods
Sort
View
CIKM
2010
Springer
14 years 9 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
JMLR
2010
165views more  JMLR 2010»
14 years 6 months ago
Causal Inference
: This review presents empirical researchers with recent advances in causal inference, and stresses the paradigmatic shifts that must be undertaken in moving from traditional stati...
Judea Pearl
PLDI
2012
ACM
13 years 2 months ago
Design and implementation of sparse global analyses for C-like languages
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, Kw...
SIGSOFT
2007
ACM
16 years 18 days ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SIGSOFT
2003
ACM
16 years 18 days ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...