10988 search results - page 390 / 2198 » Algorithmic Folding Complexity |
130
Voted
IJFCS
2008
15 years 5 months ago
2008
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
141
Voted
JDA
2006
15 years 5 months ago
2006
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
140
click to vote
SIGPRO
2008
15 years 5 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
187
click to vote
ENTCS
2002
15 years 4 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
142
Voted
WIOPT
2010
IEEE
15 years 3 months ago
2010
IEEE
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...