Sciweavers

724 search results - page 127 / 145
» Discrete Rate Simulation using linear programming
Sort
View
COCOON
2007
Springer
15 years 3 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 7 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
99
Voted
WSC
1997
14 years 11 months ago
Covalidation of Dissimilarly Structured Models
A methodology is presented which allows comparison between models under different modeling paradigms. Consider the following situation: Two models have been constructed to study d...
Samuel A. Wright, Kenneth W. Bauer Jr.