In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
We introduce a formal semantics based calculus of trust that explicitly represents trust and quantifies the risk associated with trust in public key infrastructure (PKI) and iden...
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
Juan E. Suris, Luiz A. DaSilva, Zhu Han, Allen B. ...
Mobile devices are treasure boxes of personal information containing user’s context, personal schedule, diary, short messages, photos, and videos. Also, user’s usage informatio...