3328 search results - page 251 / 666 » On Plateaued Functions and Their Constructions |
196
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
223
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
173
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
192
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
158
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...