Sciweavers

13214 search results - page 2545 / 2643
» Pseudorandomness for network algorithms
Sort
View
WWW
2003
ACM
16 years 5 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
PODC
2009
ACM
16 years 4 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
16 years 4 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
KDD
2009
ACM
296views Data Mining» more  KDD 2009»
16 years 4 months ago
Anonymizing healthcare data: a case study on the blood transfusion service
: Gaining access to high-quality health data is a vital requirement to informed decision making for medical practitioners and pharmaceutical researchers. Driven by mutual benefits ...
Noman Mohammed, Benjamin C. M. Fung, Patrick C. K....
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 4 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
« Prev « First page 2545 / 2643 Last » Next »