Sciweavers

1272 search results - page 45 / 255
» The Set Cover with Pairs Problem
Sort
View
126
Voted
DAC
2009
ACM
15 years 10 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
142
Voted
ICST
2010
IEEE
15 years 2 months ago
(Un-)Covering Equivalent Mutants
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
David Schuler, Andreas Zeller
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
15 years 3 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
182
Voted
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
15 years 1 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
148
Voted
SP
2006
IEEE
102views Security Privacy» more  SP 2006»
15 years 9 months ago
Secure Device Pairing based on a Visual Channel (Short Paper)
Recently several researchers and practitioners have begun to address the problem of how to set up secure communication between two devices without the assistance of a trusted thir...
Nitesh Saxena, Jan-Erik Ekberg, Kari Kostiainen, N...