Sciweavers

1662 search results - page 245 / 333
» Privately Finding Specifications
Sort
View
RECOMB
2005
Springer
14 years 11 months ago
An Interaction-Dependent Model for Transcription Factor Binding
Transcriptional regulation is accomplished by several transcription factor proteins that bind to specific DNA elements in the relative vicinity of the gene, and interact with each ...
Li-San Wang, Shane T. Jensen, Sridhar Hannenhalli
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 11 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 11 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 11 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
OSDI
2002
ACM
14 years 11 months ago
Resource Overbooking and Application Profiling in Shared Hosting Platforms
In this paper, we present techniques for provisioning CPU and network resources in shared hosting platforms running potentially antagonistic third-party applications. The primary ...
Bhuvan Urgaonkar, Prashant J. Shenoy, Timothy Rosc...