—Traditional approaches to K-anonymity provide privacy guarantees over publicly released data sets with specified quasi-identifiers. However, the most common public releases of...
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
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...
This paper presents a multimodal social networking system aimed at sharing geographic information among proximate users. The system provides users with a traditional web-based int...
Stan Kurkovsky, David Strimple, Eric Nuzzi, Kerry ...
Previous research has shown a relationship between use of social networking sites and feelings of social capital. However, most studies have relied on self-reports by college stud...