2531 search results - page 191 / 507 » Group testing in graphs |
190
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
146
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
179
click to vote
ICSE
2008
IEEE-ACM
16 years 6 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
171
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
165
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...