Sciweavers

3068 search results - page 161 / 614
» Clustering with Multiple Graphs
Sort
View
123
Voted
EGC
2005
Springer
15 years 9 months ago
The Design and Implementation of the KOALA Co-allocating Grid Scheduler
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
HPDC
2003
IEEE
15 years 9 months ago
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
136
Voted
BMVC
2000
15 years 5 months ago
Detecting Multiple Texture Planes using Local Spectral Distortion
This paper presents a spectral method for identifying multiple texture planes. We commence by showing how pairs of spectral peaks can be used to make direct estimates of the slant...
Eraldo Ribeiro, Edwin R. Hancock
157
Voted
ICIP
2009
IEEE
15 years 1 months ago
Object tracking using multiple fragments
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...
Claudio R. Jung, Amir Said
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 1 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...