5606 search results - page 31 / 1122 » Randomization Techniques for Graphs. |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
CSDA
2010
13 years 8 months ago
2010
Abstract: Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph fe...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
DM
2008
13 years 8 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...