4539 search results - page 883 / 908 » Approaches to Compute Workflow Complexity |
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...
WABI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
BTW
2009
Springer
14 years 2 months ago
2009
Springer
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
CHIMIT
2009
ACM
14 years 1 months ago
2009
ACM
End users are often frustrated by unexpected problems while using networked software, leading to frustrated calls to the help desk seeking solutions. However, trying to locate the...