2000 search results - page 334 / 400 » Program Transformation and Proof Transformation |
152
click to vote
CSR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
144
Voted
PAM
2012
Springer
13 years 11 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
140
click to vote
JMLR
2012
13 years 5 months ago
2012
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for...
193
click to vote
JMLR
2012
13 years 5 months ago
2012
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
139
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...