5608 search results - page 44 / 1122 » On the Theory of Matchgate Computations |
102
click to vote
PKC
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
123
Voted
MM
1996
ACM
15 years 5 months ago
1996
ACM
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
105
click to vote
TMI
2008
15 years 1 months ago
2008
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
134
click to vote
WEA
2010
Springer
15 years 8 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
119
click to vote
NIPS
2004
15 years 2 months ago
2004
Experimental studies have observed synaptic potentiation when a presynaptic neuron fires shortly before a postsynaptic neuron, and synaptic depression when the presynaptic neuron ...