Sciweavers

2687 search results - page 397 / 538
» Formal Analysis of PKCS
Sort
View
WWW
2008
ACM
16 years 7 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev
WWW
2008
ACM
16 years 7 months ago
Topic modeling with network regularization
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic mo...
Qiaozhu Mei, Deng Cai, Duo Zhang, ChengXiang Zhai
ECOOP
2009
Springer
16 years 7 months ago
Checking Framework Interactions with Relationships
Software frameworks impose constraints on how plugins may interact with them. Many of hese constraints involve multiple objects, are temporal, and depend on runtime values. Additi...
Ciera Jaspan, Jonathan Aldrich
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 6 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
POPL
2006
ACM
16 years 6 months ago
A logic for information flow in object-oriented programs
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee