Sciweavers

2286 search results - page 21 / 458
» Algorithms for Categorical Equivalence
Sort
View
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
13 years 11 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
RTAS
2008
IEEE
14 years 1 months ago
Equivalence between Schedule Representations: Theory and Applications
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
Matthieu Lemerre, Vincent David, Christophe Aussag...
FSS
2008
130views more  FSS 2008»
13 years 7 months ago
A fuzzy k-partitions model for categorical data and its comparison to the GoM model
The grade of membership (GoM) model uses fuzzy sets as memberships of each individual to extreme profiles (or classes) on the likelihood function of multivariate multinomial distr...
Miin-Shen Yang, Yu-Hsuan Chiang, Chiu-Chi Chen, Ch...
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 11 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
14 years 1 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu