Sciweavers

265 search results - page 44 / 53
» Weakly Algebraizable Logics
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ICCAD
2003
IEEE
175views Hardware» more  ICCAD 2003»
14 years 4 months ago
Path Delay Estimation using Power Supply Transient Signals: A Comparative Study using Fourier and Wavelet Analysis
Transient Signal Analysis (TSA) is a parametric device testing technique based on the analysis of dynamic (transient) current (iDDT) drawn by the core logic from the power supply ...
Abhishek Singh, Jitin Tharian, Jim Plusquellic
INDIASE
2009
ACM
14 years 2 months ago
Instant multi-tier web applications without tears
We describe how development productivity for multi-tier webbased database ‘forms’ oriented applications can be significantly improved using ‘InstantApps’, an interpretive ...
Gautam Shroff, Puneet Agarwal, Premkumar T. Devanb...
HOST
2008
IEEE
14 years 1 months ago
Place-and-Route Impact on the Security of DPL Designs in FPGAs
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...
Sylvain Guilley, Sumanta Chaudhuri, Jean-Luc Dange...
KBSE
2007
IEEE
14 years 1 months ago
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
Kobi Inkumsah, Tao Xie