5606 search results - page 700 / 1122 » Randomization Techniques for Graphs. |
183
click to vote
IPSN
2005
Springer
16 years 12 days ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
184
click to vote
MICCAI
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
215
click to vote
ATAL
2004
Springer
16 years 9 days ago
2004
Springer
This paper is concerned with merging globally rigid formations of mobile autonomous agents. A key element in all future multi-agent systems will be the role of sensor and communic...
167
click to vote
ICCSA
2004
Springer
16 years 8 days ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
172
click to vote
SIGADA
2004
Springer
16 years 7 days ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...