Sciweavers

1060 search results - page 187 / 212
» Notes on Coding Theory
Sort
View
WWW
2004
ACM
15 years 10 months ago
Anti-aliasing on the web
It is increasingly common for users to interact with the web using a number of different aliases. This trend is a doubleedged sword. On one hand, it is a fundamental building bloc...
Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
15 years 10 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
PLDI
2009
ACM
15 years 4 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
15 years 4 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ICA
2007
Springer
15 years 3 months ago
Compressed Sensing and Source Separation
Abstract. Separation of underdetermined mixtures is an important problem in signal processing that has attracted a great deal of attention over the years. Prior knowledge is requir...
Thomas Blumensath, Mike E. Davies