Sciweavers

1055 search results - page 23 / 211
» Enumerations in computable structure theory
Sort
View
COGSCI
2008
139views more  COGSCI 2008»
13 years 10 months ago
A Computational Model of Early Argument Structure Acquisition
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Afra Alishahi, Suzanne Stevenson
ASIACRYPT
2008
Springer
13 years 12 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas
APN
2007
Springer
14 years 4 months ago
Petri Nets, Discrete Physics, and Distributed Quantum Computation
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
Samson Abramsky
LICS
2008
IEEE
14 years 4 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
TCBB
2010
104views more  TCBB 2010»
13 years 8 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya