Sciweavers

2092 search results - page 352 / 419
» A Theory of Non-Deterministic Networks
Sort
View
CHI
2009
ACM
15 years 12 months ago
Predicting tie strength with social media
Social media treats all users the same: trusted friend or total stranger, with little or nothing in between. In reality, relationships fall everywhere along this spectrum, a topic...
Eric Gilbert, Karrie Karahalios
SPAA
2009
ACM
15 years 12 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
15 years 12 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
KDD
2002
ACM
191views Data Mining» more  KDD 2002»
15 years 11 months ago
Multimedia Knowledge Integration, Summarization And Evaluation
This paper presents new methods for automatically integrating, summarizing and evaluating multimedia knowledge. These are essential for multimedia applications to efficiently and ...
Ana B. Benitez, Shih-Fu Chang
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 11 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan