745 search results - page 138 / 149 » On Generating Random Network Structures: Connected Graphs |
125
click to vote
ICIG
2009
IEEE
14 years 10 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
RECOMB
2010
Springer
15 years 7 months ago
2010
Springer
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
138
Voted
TSP
2010
14 years 7 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
112
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
122
Voted
CISIS
2008
IEEE
15 years 2 months ago
2008
IEEE
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...