Sciweavers

507 search results - page 93 / 102
» Sizes of Ordered Decision Trees
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 5 days 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...
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
IADIS
2003
13 years 9 months ago
Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
Ezendu Ifeanyi Ariwa, Mohamed B. Senousy, Mohamed ...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 7 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...