2137 search results - page 305 / 428 » Proving Abstract Non-interference |
114
Voted
FSEN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
121
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
134
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
133
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
135
click to vote
ICB
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a novel representation, called Multiscale Block Local Binary Pattern (MB-LBP), and apply it to face recognition. The Local Binary Pattern (LBP) ...