406 search results - page 50 / 82 » Privacy-Preserving Set Union |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
BMCBI
2006
13 years 7 months ago
2006
Metabolic networks are naturally represented as directed hypergraphs in such a way that metabolites are nodes and enzyme-catalyzed reactions form (hyper)edges. The familiar operat...
JSAC
2000
13 years 7 months ago
2000
We introduce a general adaptive coding scheme for Nakagami multipath fading channels. An instance of the coding scheme utilizes a set of 2 -dimensional (2 -D) trellis codes origina...
PR
2007
13 years 7 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...