Sciweavers

63 search results - page 9 / 13
» A New Algorithm for Sampling CSP Solutions Uniformly at Rand...
Sort
View
CEC
2010
IEEE
13 years 9 months ago
A Mean-Variance Optimization algorithm
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ILP
2004
Springer
14 years 1 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
UAI
2004
13 years 9 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 9 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan