Sciweavers

694 search results - page 81 / 139
» Open Graphs and Computational Reasoning
Sort
View
AAAI
2007
14 years 18 days ago
A Connectionist Cognitive Model for Temporal Synchronisation and Learning
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...
Luís C. Lamb, Rafael V. Borges, Artur S. d'...
LICS
2010
IEEE
13 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
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...
Luis Barguñó, Carles Creus, Guillem ...
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
14 years 4 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
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...
Saurabh Panjwani
UIST
2005
ACM
14 years 3 months ago
Supporting interaction in augmented reality in the presence of uncertain spatial knowledge
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...
Enylton Machado Coelho, Blair MacIntyre, Simon Jul...
TIT
2011
131views more  TIT 2011»
13 years 5 months ago
On the Hardness of Approximating the Network Coding Capacity
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 ...
Michael Langberg, Alexander Sprintson