Sciweavers

38 search results - page 7 / 8
» Randomized Competitive Analysis for Two-Server Problems
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 7 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
COCOA
2010
Springer
13 years 3 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 6 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
BMCBI
2007
128views more  BMCBI 2007»
13 years 5 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
DMIN
2008
190views Data Mining» more  DMIN 2008»
13 years 7 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich