Sciweavers

40 search results - page 2 / 8
» Local Topological Toughness and Local Factors
Sort
View
IPL
2010
109views more  IPL 2010»
14 years 6 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
ASPDAC
2001
ACM
104views Hardware» more  ASPDAC 2001»
15 years 3 months ago
Optimal spacing and capacitance padding for general clock structures
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
ICRA
2009
IEEE
143views Robotics» more  ICRA 2009»
15 years 6 months ago
Decentralized localization for dynamic and sparse robot networks
Abstract— Finite-range sensing and communication are factors in the connectivity of a dynamic mobile robot network. State estimation becomes a difficult problem when communicati...
Keith Yu Kit Leung, Timothy D. Barfoot, Hugh H. T....
TMC
2010
224views more  TMC 2010»
14 years 10 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 10 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman