3495 search results - page 252 / 699 » On the random satisfiable process |
191
click to vote
QEST
2010
IEEE
15 years 5 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
215
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
228
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
223
click to vote
TIP
2010
15 years 1 months ago
2010
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
221
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...