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...
In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in use...
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
Abstract. To investigate the structure of the genomic interaction network built from yeast gene-expression compendium dataset of hundreds of systematic perturbations, social affili...
We explore how expert First Person Shooter (FPS) players coordinate actions using a shared voice channel. Our findings emphasize the importance of the temporality and spatiality o...
Anthony Tang, Jonathan Massey, Nelson Wong, Derek ...