Sciweavers

5473 search results - page 69 / 1095
» On the graph isomorphism problem
Sort
View
DATE
2005
IEEE
119views Hardware» more  DATE 2005»
15 years 5 months ago
Functional Validation of System Level Static Scheduling
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for comparing...
Samar Abdi, Daniel D. Gajski
EJC
2008
14 years 12 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
15 years 6 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
DM
2006
132views more  DM 2006»
14 years 12 months ago
Recursive fault-tolerance of Fibonacci cube in hypercubes
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
Petr Gregor
CORR
2007
Springer
101views Education» more  CORR 2007»
14 years 12 months ago
A Matrix Ring Description for Cyclic Convolutional Codes
: In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew ...
Heide Gluesing-Luerssen, Fai-Lung Tsang