Sciweavers

7522 search results - page 408 / 1505
» Spacing memetic algorithms
Sort
View
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
16 years 1 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
16 years 1 months ago
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
George Labahn, Ziming Li
CHI
1994
ACM
15 years 11 months ago
Hierarchical visualization with treemaps: making sense of pro basketball data
Treemaps support visualization of large hierarchical information spaces. The treemap generation algorithm is straightforward and application prototypes have only minimal hardware ...
David Turo
SIGGRAPH
1995
ACM
15 years 11 months ago
Stochastic screening dithering with adaptive clustering
We developa clustereddithering methodthatusesstochasticscreening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendit...
Luiz Velho, Jonas Gomes
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
15 years 9 months ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka