Sciweavers

3256 search results - page 129 / 652
» Learning Linear Transformations
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
14 years 3 days ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
ECCC
2007
77views more  ECCC 2007»
13 years 10 months ago
Selected Results in Additive Combinatorics: An Exposition
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
Emanuele Viola
CA
2003
IEEE
14 years 3 months ago
Expressive Gesture Animation Based on Non Parametric Learning of Sensory-Motor Models
This paper presents an efficient method of learning motion control for autonomous animated characters. The method uses a non parametric learning approach which identifies non line...
Sylvie Gibet, Pierre-Francois Marteau
DCC
2008
IEEE
14 years 9 months ago
High-Resolution Functional Quantization
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...
Vinith Misra, Vivek K. Goyal, Lav R. Varshney