15033 search results - page 2632 / 3007 » Complexity Theory and Algorithms |
167
click to vote
ALT
2001
Springer
16 years 3 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
156
click to vote
ICCD
2006
IEEE
16 years 3 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...
185
click to vote
ICCD
2003
IEEE
16 years 3 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
152
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
Modern IC designs have reached unparalleled levels of complexity, resulting in more and more bugs discovered after design tape-out However, so far only very few EDA tools for post...
129
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...