Sciweavers

264 search results - page 36 / 53
» On Linear Cryptanalysis with Many Linear Approximations
Sort
View
MLG
2007
Springer
15 years 7 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
15 years 10 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
EUROCRYPT
2004
Springer
15 years 5 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
ECAI
2008
Springer
15 years 3 months ago
Reinforcement Learning with the Use of Costly Features
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens
TCOM
2008
83views more  TCOM 2008»
15 years 1 months ago
Toward a unified framework for modeling and analysis of diversity in joint source-channel coding
The study of Joint Source-Channel Coding (JSCC) systems faces one major challenge in obtaining an analytical expression for the function that links end-to-end distortion with chann...
Andres Kwasinski, K. J. Ray Liu