1502 search results - page 228 / 301 » Node weighted scheduling |
IPMI
2011
Springer
13 years 5 days ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
GIS
2004
ACM
14 years 9 months ago
2004
ACM
Sensor networks are unattended deeply distributed systems whose schema can be conceptualized using the relational model. Aggregation queries on the data sampled at each ode are th...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
WAW
2004
Springer
14 years 2 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...