6542 search results - page 1027 / 1309 » The tao of parallelism in algorithms |
155
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
214
click to vote
BIBE
2008
IEEE
16 years 1 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...
235
click to vote
ICANNGA
2007
Springer
16 years 27 days 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...
236
click to vote
KDD
2007
ACM
16 years 27 days 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...
167
click to vote
RTCSA
2006
IEEE
16 years 23 days 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...