Sciweavers

2503 search results - page 460 / 501
» A study of 3-arc graphs
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 7 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
ALMOB
2006
138views more  ALMOB 2006»
13 years 7 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
CN
2006
70views more  CN 2006»
13 years 7 months ago
Small-world characteristics of Internet topologies and implications on multicast scaling
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
Shudong Jin, Azer Bestavros