2473 search results - page 255 / 495 » The Logic of Communication Graphs |
193
click to vote
COCOA
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
170
click to vote
TCC
2007
Springer
16 years 23 days 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...
184
click to vote
PRDC
2006
IEEE
16 years 20 days 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...
193
click to vote
ICDAR
2005
IEEE
16 years 8 days 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...
192
click to vote
SSDBM
2005
IEEE
16 years 7 days 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...