4428 search results - page 789 / 886 » The Chow Parameters Problem |
174
click to vote
AOSD
2011
ACM
14 years 7 months ago
2011
ACM
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
134
click to vote
IACR
2011
14 years 3 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
165
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
116
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
131
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...