Sciweavers

521 search results - page 56 / 105
» Social Network Discovery Based on Sensitivity Analysis
Sort
View
CSCWD
2005
Springer
13 years 10 months ago
Process mining in CSCW systems
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
AEI
2007
119views more  AEI 2007»
13 years 9 months ago
Exploring the CSCW spectrum using process mining
Process mining techniques allow for extracting information from event logs. For example, the audit trails of a workflow management system or the transaction logs of an enterprise ...
Wil M. P. van der Aalst
JCM
2008
121views more  JCM 2008»
13 years 8 months ago
A Cooperative Secure Routing Protocol based on Reputation System for Ad Hoc Networks
In wireless ad hoc networks, all its nodes behave as routers and take part in its discovery and maintenance of routes to other nodes. Thus, the presence of selfish or malicious nod...
Yihui Zhang, Li Xu, Xiaoding Wang
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
13 years 15 days ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
EPIA
2009
Springer
14 years 3 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...