Sciweavers

1449 search results - page 239 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
GBRPR
2007
Springer
16 years 4 days ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
ICDT
2007
ACM
141views Database» more  ICDT 2007»
16 years 4 days ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
TACAS
2007
Springer
158views Algorithms» more  TACAS 2007»
16 years 3 days ago
Automatic Analysis of the Security of XOR-Based Key Management Schemes
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
Véronique Cortier, Gavin Keighren, Graham S...
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
16 years 3 days ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
16 years 2 days ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...