Sciweavers

421 search results - page 79 / 85
» A divide-and-merge methodology for clustering
Sort
View
IEEEPACT
2002
IEEE
14 years 10 days ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 12 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...
AFRIGRAPH
2010
ACM
13 years 11 months ago
Visualization of solution sets from automated docking of molecular structures
Aligning structures, often referred to as docking or registration, is frequently required in fields such as computer science, robotics and structural biology. The task of alignin...
Johannes Jansen van Vuuren, Michelle Kuttel, James...
HIS
2007
13 years 8 months ago
Pareto-based Multi-Objective Machine Learning
—Machine learning is inherently a multiobjective task. Traditionally, however, either only one of the objectives is adopted as the cost function or multiple objectives are aggreg...
Yaochu Jin
MASCOTS
2008
13 years 8 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park