260 search results - page 34 / 52 » Dynamic Random Geometric Graphs |
109
click to vote
MST
2010
14 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
120
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
MICCAI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...