Sciweavers

5802 search results - page 300 / 1161
» Parallelizing Feature Selection
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A leader-based parallel cross entropy algorithm for MCP
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Zhanhua Bai, Qiang Lv
ICPP
2006
IEEE
15 years 10 months ago
Parallel Information Extraction on Shared Memory Multi-processor System
Text Mining is one of the best solutions for today and the future’s information explosion. With the development of modern processor technologies, it will be a mass market deskto...
Jiulong Shan, Yurong Chen, Qian Diao, Yimin Zhang
CCGRID
2005
IEEE
15 years 9 months ago
Empirical evaluation of shared parallel execution on independently scheduled clusters
Parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing ...
M. Ghanesh, S. Kumar, Jaspal Subhlok
PPOPP
2005
ACM
15 years 9 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
SC
2003
ACM
15 years 9 months ago
Compiler Support for Exploiting Coarse-Grained Pipelined Parallelism
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
Wei Du, Renato Ferreira, Gagan Agrawal