499 search results - page 19 / 100 » A Search Algorithm for Clusters in a Network or Graph |
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
BMCBI
2011
12 years 11 months ago
2011
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
AINA
2004
IEEE
13 years 11 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...