Sciweavers

4903 search results - page 581 / 981
» The Set Covering Machine
Sort
View
286
Voted
SCHEDULING
2011
15 years 1 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
WWW
2011
ACM
15 years 1 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
SAC
2010
ACM
15 years 1 months ago
A new methodology for photometric validation in vehicles visual interactive systems
This work proposes a new methodology for automatically validating the internal lighting system of an automotive, i.e., assessing the visual quality of an instrument cluster (IC) f...
Alexandre W. C. Faria, David Menotti, Daniel S. D....
BMCBI
2011
14 years 10 months ago
Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic ...
Zafer Aydin, Ajit Singh, Jeff Bilmes, William Staf...
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
13 years 9 months ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar