171 search results - page 1 / 35 » Compressed Representations of Permutations, and Applications |
STACS
2009
Springer
13 years 11 months ago
2009
Springer
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
WWW
2001
ACM
14 years 5 months ago
2001
ACM
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
PLDI
2006
ACM
13 years 10 months ago
2006
ACM
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...