Sciweavers

215 search results - page 21 / 43
» On extremal k-outconnected graphs
Sort
View
BMCBI
2011
13 years 1 months ago
Ultra-fast sequence clustering from similarity networks with SiLiX
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
Vincent Miele, Simon Penel, Laurent Duret
ICNP
2005
IEEE
14 years 1 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 2 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
CVPR
2007
IEEE
14 years 9 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler