Sciweavers

644 search results - page 28 / 129
» A topological characterization of weakness
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
COMPGEOM
2010
ACM
15 years 11 months ago
Optimal reconstruction might be hard
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
Dominique Attali, André Lieutier
CCR
2006
82views more  CCR 2006»
15 years 6 months ago
The internet AS-level topology: three data sources and one definitive metric
We calculate an extensive set of characteristics for Internet AS topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP,...
Priya Mahadevan, Dmitri V. Krioukov, Marina Fomenk...
ICASSP
2009
IEEE
16 years 27 days ago
The speed of greed: Characterizing myopic gossip through network voracity
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
GBRPR
2007
Springer
16 years 9 days ago
Graph-Based Methods for Retinal Mosaicing and Vascular Characterization
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
Wendy Aguilar, M. Elena Martínez-Pér...