Sciweavers

26354 search results - page 157 / 5271
» How we refactor, and how we know it
Sort
View
EUROCRYPT
2012
Springer
12 years 24 days ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
BMCBI
2006
123views more  BMCBI 2006»
13 years 10 months ago
How to decide? Different methods of calculating gene expression from short oligonucleotide array data will give different result
Background: Short oligonucleotide arrays for transcript profiling have been available for several years. Generally, raw data from these arrays are analysed with the aid of the Mic...
Frank F. Millenaar, John Okyere, Sean T. May, Mart...
DAC
2000
ACM
14 years 11 months ago
System chip test: how will it impact your design?
A major challenge in realizing core-based system chips is the adoption and design-in of adequate test and diagnosis strategies. This tutorial paper discusses the specific challeng...
Yervant Zorian, Erik Jan Marinissen
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 10 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
HICSS
2009
IEEE
167views Biometrics» more  HICSS 2009»
14 years 5 months ago
E-Commerce and E-Government: How Do They Compare? What Can They Learn from Each Other?
For more than a decade e-Commerce and eGovernment applications have made major impacts in their respective sectors, private and public. Some time ago, we presented early insights ...
Hans Jochen Scholl, Karine Barzilai-Nahon, Jin-Hyu...