Sciweavers

980 search results - page 78 / 196
» A Sequential Reduction Strategy
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 2 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
PAKDD
2004
ACM
164views Data Mining» more  PAKDD 2004»
15 years 3 months ago
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
Francesco Bonchi, Bart Goethals
CEC
2003
IEEE
15 years 3 months ago
Homology gives size control in genetic programming
Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully test...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
FSTTCS
2008
Springer
14 years 11 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
AAAI
2010
14 years 6 months ago
Multilinear Maximum Distance Embedding Via L1-Norm Optimization
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
Yang Liu, Yan Liu, Keith C. C. Chan