1480 search results - page 268 / 296 » Distributed algorithms for weighted problems in sparse graph... |
PODS
2008
ACM
15 years 12 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
122
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
142
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
109
click to vote
JIIS
2006
14 years 11 months ago
2006
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
100
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...