45 search results - page 6 / 9 » Hamiltonicity of Topological Grid Graphs |
TDSC
2010
13 years 5 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
LATIN
2010
Springer
13 years 5 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
IPMI
2007
Springer
14 years 8 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...