3122 search results - page 87 / 625 » A Theory of Network Equivalence |
153
click to vote
IJCV
2000
15 years 6 months ago
2000
In this paper we first overview the main concepts of Statistical Learning Theory, a framework in which learning from examples can be studied in a principled way. We then briefly di...
149
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
140
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper examines the stability of quantum feedback networks. We introduce a novel characterization, in terms of equivalence classes of operators, that may be used to...
134
click to vote
STACS
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
147
click to vote
AAECC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...