Sciweavers

16430 search results - page 326 / 3286
» On Computable Tree Functions
Sort
View
150
Voted
IEAAIE
2011
Springer
14 years 8 months ago
An Agent Model for Computational Analysis of Mirroring Dysfunctioning in Autism Spectrum Disorders
Persons with an Autism Spectrum Disorder (ASD) may show certain types of deviations in social functioning. Since the discovery of mirror neuron systems and their role in social fun...
Yara van der Laan, Jan Treur
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
14 years 13 days ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
ICDCS
1999
IEEE
15 years 9 months ago
On Providing Quality-of-Service Control for Core-Based Multicast Routing
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
Hung-Ying Tyan, Chao-Ju Hou, Bin Wang 0002
ICDCS
1996
IEEE
15 years 9 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
SIAMSC
2011
177views more  SIAMSC 2011»
14 years 12 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad