Sciweavers

1629 search results - page 60 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 10 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
GLOBECOM
2008
IEEE
14 years 10 months ago
Energy-Efficient Transmission in Frequency-Selective Channels
Abstract--Energy efficiency is becoming increasingly important for small form factor mobile devices, as battery technology has not kept up with the growing requirements stemming fr...
Guowang Miao, Nageen Himayat, Ye (Geoffrey) Li
PLDI
2009
ACM
15 years 4 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
ASPDAC
2009
ACM
100views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Noise minimization during power-up stage for a multi-domain power network
– With the popularity of Multiple Power Domain (MPD) design, the multi-domain power network noise analysis and minimization is becoming important. This paper describes an efficie...
Wanping Zhang, Yi Zhu, Wenjian Yu, Amirali Shayan ...
BMCBI
2010
143views more  BMCBI 2010»
14 years 10 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano