Sciweavers

738 search results - page 111 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
CCS
2008
ACM
14 years 11 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
14 years 7 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli
EWC
2011
52views more  EWC 2011»
14 years 4 months ago
Localized coarsening of conforming all-hexahedral meshes
Abstract. Finite element mesh adaptation methods can be used to improve the efficiency and accuracy of solutions to computational modeling problems. In many applications involving ...
Adam C. Woodbury, Jason F. Shepherd, Matthew L. St...
MOBIHOC
2009
ACM
15 years 10 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
VLSID
2007
IEEE
153views VLSI» more  VLSID 2007»
15 years 10 months ago
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik