15375 search results - page 2725 / 3075 » cans 2008 |
179
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
186
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
163
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
189
click to vote
CSSE
2008
IEEE
15 years 8 months ago
2008
IEEE
Both teaching and learning multithreaded ing are complex tasks, due to the abstraction of the concepts, the non-determinism of the scheduler, the impossibility of using classical s...
154
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
Recently, Juels and Weis defined strong privacy for RFID tags. We add to this definition a completeness and a soundness requirement, i.e., a reader should accept valid tags and onl...