Sciweavers

3265 search results - page 397 / 653
» Representing Groups on Graphs
Sort
View
IJBIDM
2010
80views more  IJBIDM 2010»
15 years 5 months ago
Practical algorithms for subgroup detection in covert networks
: In this paper, we present algorithms for subgroup detection and demonstrated them with a real-time case study of USS Cole bombing terrorist network. The algorithms are demonstrat...
Nasrullah Memon, Uffe Kock Wiil, Abdul Rasool Qure...
INFOCOM
2010
IEEE
15 years 5 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
SSIRI
2010
15 years 5 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit
SSS
2010
Springer
118views Control Systems» more  SSS 2010»
15 years 5 months ago
Modeling and Analyzing Periodic Distributed Computations
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
Anurag Agarwal, Vijay K. Garg, Vinit A. Ogale
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 5 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...