347 search results - page 23 / 70 » The Berlekamp-Massey Algorithm revisited |
108
click to vote
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
96
Voted
ACSD
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
97
Voted
ESA
2006
Springer
15 years 2 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
93
Voted
NETWORKS
2006
14 years 10 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
82
Voted
MICS
2010
14 years 9 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...