Sciweavers

420 search results - page 41 / 84
» Search on High Degree Graphs
Sort
View
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 7 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
124
Voted
DCC
2011
IEEE
14 years 7 months ago
Directed graph representation of half-rate additive codes over GF(4)
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
Lars Eirik Danielsen, Matthew G. Parker
87
Voted
JCIT
2007
111views more  JCIT 2007»
15 years 19 days ago
Edge Closing of Synthetic and Real Images using Polynomial Fitting
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as inco...
M. Benjelloun, H. J. Tellez Oliva, R. Prevot
102
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks
—Wireless Mesh Networks have been an emerging technology in the past years. They are mainly used for providing last-mile broadband wireless access. It is then highly recommended ...
Salim Nahle, Naceur Malouch
93
Voted
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 4 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...