Sciweavers

10670 search results - page 110 / 2134
» Required Information Release
Sort
View
127
Voted
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 5 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
138
Voted
ACSW
2007
15 years 3 months ago
Controlling Inference: Avoiding P-level Reduction during Analysis
This paper presents a concept hierarchy-based approach to privacy preserving data collection for data mining called the P-level model. The P-level model allows data providers to d...
Adepele Williams, Ken Barker
99
Voted
DKE
2008
106views more  DKE 2008»
15 years 1 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li
BMCBI
2006
98views more  BMCBI 2006»
15 years 1 months ago
The Secrets of a Functional Synapse - From a Computational and Experimental Viewpoint
Background: Neuronal communication is tightly regulated in time and in space. The neuronal transmission takes place in the nerve terminal, at a specialized structure called the sy...
Michal Linial
JSSPP
2009
Springer
15 years 8 months ago
The Gain of Overbooking
This paper analyzes the effect of overbooking for scheduling systems in a commercial environment. In this scenario each job is associated with a release time and a finishing deadl...
Georg Birkenheuer, André Brinkmann, Holger ...