Sciweavers

1722 search results - page 122 / 345
» On the sample mean of graphs
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
16 years 3 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang
COOPIS
2004
IEEE
15 years 10 months ago
Service Graphs for Building Trust
Information systems must establish trust to cooperate effectively in open environments. We are developing an agent-based approach for establishing trust, where information systems ...
Pinar Yolum, Munindar P. Singh
CAISE
2010
Springer
15 years 7 months ago
Design and Verification of Instantiable Compliance Rule Graphs in Process-Aware Information Systems
For enterprises it has become crucial to check compliance of their business processes with certain rules such as medical guidelines or financial regulations. When automating compli...
Linh Thao Ly, Stefanie Rinderle-Ma, Peter Dadam
RTS
2006
176views more  RTS 2006»
15 years 6 months ago
Verifying distributed real-time properties of embedded systems via graph transformations and model checking
Component middleware provides dependable and efficient platforms that support key functional, and quality of service (QoS) needs of distributed real-time embedded (DRE) systems. C...
Gabor Madl, Sherif Abdelwahed, Douglas C. Schmidt