1060 search results - page 187 / 212 » Notes on Coding Theory |
156
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
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...
134
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
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 ...
160
click to vote
PLDI
2009
ACM
16 years 10 days ago
2009
ACM
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...
146
Voted
APPROX
2009
Springer
16 years 4 days ago
2009
Springer
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...
163
click to vote
ICA
2007
Springer
15 years 11 months ago
2007
Springer
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...