2911 search results - page 405 / 583 » A Logic of Graph Constraints |
TCC
2007
Springer
15 years 7 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
114
click to vote
PRDC
2006
IEEE
15 years 7 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
128
Voted
ICDAR
2005
IEEE
15 years 6 months ago
2005
IEEE
The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual...
106
Voted
SRDS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
117
click to vote
SSDBM
2005
IEEE
15 years 6 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...