1092 search results - page 179 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ICCD
2006
IEEE
15 years 10 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
105
click to vote
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
131
click to vote
ICML
2009
IEEE
15 years 8 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
145
click to vote
CPM
2009
Springer
15 years 8 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
121
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...