Sciweavers

1629 search results - page 16 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
VLSID
2002
IEEE
135views VLSI» more  VLSID 2002»
15 years 10 months ago
An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis
In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power ...
Rupesh S. Shelar, Sachin S. Sapatnekar
RTAS
2003
IEEE
15 years 3 months ago
An Integrated Approach for Applying Dynamic Voltage Scaling to Hard Real-Time Systems
Wireless and portable devices depend on the limited power supplied by the battery. Dynamic Voltage Scaling (DVS) is an effective method to reduce CPU power consumption. For real-t...
Yanbin Liu, Aloysius K. Mok
DAC
2010
ACM
14 years 10 months ago
An efficient dual algorithm for vectorless power grid verification under linear current constraints
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
Xuanxing Xiong, Jia Wang
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 11 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis