Sciweavers

3328 search results - page 347 / 666
» Topological Quantum Computation
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 6 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
NETWORKS
2007
15 years 6 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
EWC
2011
52views more  EWC 2011»
15 years 1 months ago
Localized coarsening of conforming all-hexahedral meshes
Abstract. Finite element mesh adaptation methods can be used to improve the efficiency and accuracy of solutions to computational modeling problems. In many applications involving ...
Adam C. Woodbury, Jason F. Shepherd, Matthew L. St...
PPNA
2011
14 years 9 months ago
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel
INFOCOM
2012
IEEE
13 years 9 months ago
Scalable routing in 3D high genus sensor networks using graph embedding
—We study scalable routing for a sensor network deployed in complicated 3D settings such as underground tunnels in gas system or water system. The nodes are in general 3D space b...
Xiaokang Yu, Xiaotian Yin, Wei Han, Jie Gao, Xianf...