1383 search results - page 214 / 277 » On the Complexity of the Interlace Polynomial |
125
click to vote
ALT
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
115
click to vote
ALT
2004
Springer
15 years 11 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
ICCD
2006
IEEE
15 years 11 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 11 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...
124
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...