Sciweavers

3909 search results - page 345 / 782
» Extreme Model Checking
Sort
View
118
Voted
SIGSOFT
2010
ACM
15 years 2 months ago
Top ten ways to make formal methods for HPC practical
Almost all fundamental advances in science and engineering crucially depend on the availability of extremely capable high performance computing (HPC) systems. Future HPC systems w...
Ganesh Gopalakrishnan, Robert M. Kirby
EMNLP
2009
15 years 1 months ago
Efficient kernels for sentence pair classification
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete
117
Voted
DIS
2004
Springer
15 years 9 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
ICDCSW
2000
IEEE
15 years 7 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 4 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...