33 search results - page 6 / 7 » Compositions of Random Functions on a Finite Set |
FUIN
2008
13 years 5 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
BMCBI
2006
13 years 5 months ago
2006
Background: Ensemble attribute profile clustering is a novel, text-based strategy for analyzing a userdefined list of genes and/or proteins. The strategy exploits annotation data ...
SIGECOM
2008
ACM
13 years 5 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...