1005 search results - page 177 / 201 » On genomic coding theory |
KDD
2004
ACM
14 years 8 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 ...
PLDI
2009
ACM
14 years 2 months 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...
APPROX
2009
Springer
14 years 2 months 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...
ICA
2007
Springer
14 years 1 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...
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...