Sciweavers

115 search results - page 22 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
ICALP
2001
Springer
13 years 11 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
BMCBI
2007
124views more  BMCBI 2007»
13 years 7 months ago
Analysis on multi-domain cooperation for predicting protein-protein interactions
Background: Domains are the basic functional units of proteins. It is believed that protein-protein interactions are realized through domain interactions. Revealing multi-domain c...
Rui-Sheng Wang, Yong Wang, Ling-Yun Wu, Xiang-Sun ...
SIGSOFT
2007
ACM
14 years 8 months ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
13 years 11 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
13 years 7 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
Jonas Mockus