694 search results - page 81 / 139 » Open Graphs and Computational Reasoning |
126
Voted
AAAI
2007
15 years 6 months ago
2007
The importance of the efforts towards integrating the symbolic and connectionist paradigms of artificial intelligence has been widely recognised. Integration may lead to more e...
148
Voted
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
120
Voted
TCC
2007
Springer
15 years 9 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...
145
click to vote
UIST
2005
ACM
15 years 9 months ago
2005
ACM
A significant problem encounteredwhen building Augmented Reality (AR) systems is that all spatial knowledge about the world has uncertainty associated with it. This uncertainty m...
130
Voted
TIT
2011
14 years 10 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...