Sciweavers

267 search results - page 27 / 54
» Anti-Ramsey properties of random graphs
Sort
View
IJON
2007
81views more  IJON 2007»
13 years 8 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 8 months ago
Random Linear Network Coding: A free cipher?
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
Luísa Lima, Muriel Médard, Joã...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 1 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CCS
2010
ACM
13 years 7 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 7 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen