1717 search results - page 266 / 344 » A Computable Spectral Theorem |
94
Voted
ECCV
1998
Springer
16 years 2 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
90
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
In this paper we present an efficient algorithm for extracting the complete statistical distribution of the input impedance of interconnect structures in the presence of a large n...
96
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
101
click to vote
STACS
2009
Springer
15 years 7 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
99
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...