177 search results - page 1 / 36 » Distributed Discovery of Large Near-Cliques |
WDAG
2009
Springer
13 years 11 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
GRID
2007
Springer
13 years 4 months ago
2007
Springer
IDA
2011
Springer
12 years 11 months ago
2011
Springer
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
JIIS
1998
13 years 4 months ago
1998
Knowledge Discovery in Databases (KDD) focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns within them. While most work on...
CLOUDCOM
2010
Springer
13 years 2 months ago
2010
Springer
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...