6129 search results - page 953 / 1226 » A parallel LLL algorithm |
148
click to vote
BIBE
2008
IEEE
15 years 9 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
154
Voted
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
154
click to vote
KDD
2007
ACM
15 years 8 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
106
click to vote
RTCSA
2006
IEEE
15 years 8 months ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
133
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...