Sciweavers

250 search results - page 26 / 50
» Stochastic Kronecker Graphs
Sort
View
SOFSEM
2007
Springer
14 years 4 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
BMCBI
2008
145views more  BMCBI 2008»
13 years 10 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 1 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002