Staffan Truvé

dblp:97/3063 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability
visual explanation
0.011990
Image interpretation using multi-relational grammars · ICCV 1990
Automata and formal languages
formal grammars
0.011990
Image interpretation using multi-relational grammars · ICCV 1990
Automata and formal languages
parsing algorithms
0.011990
Image interpretation using multi-relational grammars · ICCV 1990

Methods — techniques the papers use, named apart from their topics

graph grammar · 0.0bottom-up parsing · 0.0attribute grammars · 0.0attribute grammar · 0.0
YearPublicationVenuePosition
2015 Predicting Vulnerability Exploits in the Wild
abstract
Every day numerous new vulnerabilities and exploits are reported for a wide variety of different software configurations. There is a big need to be able to quickly assess associated risks and sort out which vulnerabilities that are likely to be exploited in real-world attacks. A small percentage of all vulnerabilities account for almost all the observed attack volume. We use machine learning to make automatic predictions for unseen vulnerabilities based on previous exploit patterns.
Michel Edkrantz, Staffan Truvé, Alan Said
CSCloud2
1990 Image interpretation using multi-relational grammars
abstract
An approach to computational vision that is based on multiple levels of interpretation is presented. The step between each level is seen as taking place in three stages-parsing (in which features and groups of features in an image are given labels), interpreting (in which several interpretations are built, assuring that each feature is given at most one explanation in terms of a higher-level label), and pruning (in which some interpretations are discarded because of global constraints). The parsing and pruning steps are guided by multirelational grammars, a generalization of ordinary attribute grammars and of graph grammars. A bottom-up parsing algorithm for this class of grammars is presented, and their usefulness in image interpretation is illustrated by examples using both synthetic and real-world data.>
Staffan Truvé
ICCV1