Sciweavers

2503 search results - page 154 / 501
» A study of 3-arc graphs
Sort
View
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
16 years 7 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
16 years 1 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin
IPPS
2007
IEEE
16 years 25 days ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
ICDCS
2006
IEEE
16 years 18 days ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
16 years 5 days ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...