229 search results - page 8 / 46 » Speeding Up Two String-Matching Algorithms |
ICIP
2010
IEEE
13 years 4 months ago
2010
IEEE
We extend our previous work on Multilinear Independent Component Analysis (MICA) by introducing a Fast-MICA algorithm that demonstrates the same improvement over classical ICA as ...
AVBPA
2003
Springer
14 years 21 days ago
2003
Springer
Speaker identification is a computationally expensive task. In this work, we propose an iterative speaker pruning algorithm for speeding up the identification in the context of rea...
IJCAI
2003
13 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...