88 search results - page 12 / 18 » The Secrecy Graph and Some of its Properties |
104
click to vote
RSA
2010
14 years 8 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
ICAIL
2007
ACM
15 years 1 months ago
2007
ACM
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper presents Respondent-Driven Sampling (RDS) as a promising technique to derive unbiased estimates of node properties in unstructured overlay networks such as Gnutella. ...
102
click to vote
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...