2479 search results - page 208 / 496 » Random Event Structures |
169
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
166
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
With more and more social network data being released, protecting the sensitive information within social networks from leakage has become an important concern of publishers. Adve...
185
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
201
click to vote
DMIN
2006
15 years 8 months ago
2006
In this paper, we propose a post randomization technique to learn a Bayesian network (BN) from distributed heterogeneous data, in a privacy sensitive fashion. In this case, two or ...