14774 search results - page 74 / 2955 » Computational complexity and evolutionary computation |
125
Voted
CPM
2008
Springer
15 years 5 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
136
Voted
TSP
2010
14 years 10 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
125
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
118
Voted
SUTC
2006
IEEE
15 years 9 months ago
2006
IEEE
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
116
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...