Sciweavers

2609 search results - page 334 / 522
» Optimizing for parallelism and data locality
Sort
View
JSSPP
2004
Springer
15 years 10 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
ICPR
2008
IEEE
15 years 11 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
SI3D
2006
ACM
15 years 11 months ago
Fast scene voxelization and applications
This paper presents a novel approach that uses graphics hardware to dynamically calculate a voxel-based representation of a scene. The voxelization is obtained on run-time in the ...
Elmar Eisemann, Xavier Décoret
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 10 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori
NIPS
2008
15 years 6 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola