505 search results - page 91 / 101 » On A Graph Formalism for Ordered Edges |
158
click to vote
PVLDB
2010
14 years 4 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
101
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. Our work involves the development of a prototype Geographical Information System GIS as an example of the use of process networks as a well-de ned high-level semantic mod...
BMCBI
2010
14 years 9 months ago
2010
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
ATVA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
ENTCS
2002
14 years 9 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...