Sciweavers

1489 search results - page 217 / 298
» The First Bug Report
Sort
View
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
15 years 3 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
ANTSW
2010
Springer
15 years 3 months ago
Evaluating the Robustness of Activator-Inhibitor Models for Cluster Head Computation
Activator-inhibitor models have been widely used to explain several morphogenetic processes. They have also been used to engineer algorithms for computer graphics, distributed syst...
Lidia Yamamoto, Daniele Miorandi
ASPDAC
2010
ACM
165views Hardware» more  ASPDAC 2010»
15 years 3 months ago
Dynamic power estimation for deep submicron circuits with process variation
- Dynamic power consumption in CMOS circuits is usually estimated based on the number of signal transitions. However, when considering glitches, this is not accurate because narrow...
Quang Dinh, Deming Chen, Martin D. F. Wong
GLOBECOM
2010
IEEE
15 years 3 months ago
Predicting Critical Intradomain Routing Events
Network equipments generate an overwhelming number of reports and alarms every day, but only a small fraction of these alarms require the intervention of network operators. Our goa...
Amelie Medem Kuatse, Renata Teixeira, Nicolas Usun...
SENSYS
2010
ACM
15 years 3 months ago
A case against routing-integrated time synchronization
To achieve more accurate global time synchronization, this paper argues for decoupling the clock distribution network from the routing tree in a multihop wireless network. We find...
Thomas Schmid, Zainul Charbiwala, Zafeiria Anagnos...