5606 search results - page 205 / 1122 » Randomization Techniques for Graphs. |
109
click to vote
PVLDB
2008
15 years 6 days ago
2008
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
81
Voted
FOCS
1994
IEEE
15 years 4 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
121
Voted
SDM
2008
SIAM
15 years 2 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
118
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
85
Voted
SPW
2005
Springer
15 years 6 months ago
2005
Springer
Protecting users’ privacy is essential for turning networks and services into trustworthy friends. Many privacy enhancing techniques, such as anonymous e-cash and mix-nets, have...