Sciweavers

563 search results - page 80 / 113
» Computing approximate PSD factorizations
Sort
View
RECOMB
2004
Springer
14 years 10 months ago
Modeling and Analysis of Heterogeneous Regulation in Biological Networks
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
Irit Gat-Viks, Amos Tanay, Ron Shamir
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 10 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
WSC
2000
13 years 11 months ago
Analyzing transformation-based simulation metamodels
We present a technique for analyzing a simulation metamodel that has been constructed using a variancestabilizing transformation. To compute a valid confidence interval for the ex...
Maria de los A. Irizarry, Michael E. Kuhl, Emily K...
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
13 years 7 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin