406 search results - page 65 / 82 » Pseudorandomness and Combinatorial Constructions |
115
Voted
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
106
Voted
EUROCRYPT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
99
Voted
ECCC
2006
15 years 20 days ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
132
Voted
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...