Sciweavers

274 search results - page 46 / 55
» Social Network Data and Practices: The Case of Friendfeed
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 8 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
SECON
2007
IEEE
14 years 1 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
SOCIALCOM
2010
13 years 5 months ago
GDC: Group Discovery Using Co-location Traces
Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailab...
Steve Mardenfeld, Daniel Boston, Susan Juan Pan, Q...
CIKM
2010
Springer
13 years 6 months ago
Building re-usable dictionary repositories for real-world text mining
Text mining, though still a nascent industry, has been growing quickly along with the awareness of the importance of unstructured data in business analytics, customer retention an...
Shantanu Godbole, Indrajit Bhattacharya, Ajay Gupt...