10988 search results - page 380 / 2198 » Algorithmic Folding Complexity |
145
Voted
SIGCSE
2005
ACM
15 years 10 months ago
2005
ACM
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...
131
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
157
click to vote
ACMSE
2009
ACM
15 years 11 months ago
2009
ACM
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
135
click to vote
ICPP
2007
IEEE
15 years 11 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
144
click to vote
SIPS
2007
IEEE
15 years 11 months ago
2007
IEEE
: - Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so...