Sciweavers

2354 search results - page 191 / 471
» Randomness, Stochasticity and Approximations
Sort
View
RSA
2010
104views more  RSA 2010»
13 years 8 months ago
An approximation algorithm for counting contingency tables
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
Alexander I. Barvinok, Zur Luria, Alex Samorodnits...
TIT
2011
116views more  TIT 2011»
13 years 4 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
SIAMAM
2000
128views more  SIAMAM 2000»
13 years 9 months ago
Advection-Diffusion Equations for Internal State-Mediated Random Walks
Abstract. In many biological examples of biased random walks, movement statistics are determined by state dynamics that are internal to the organism or cell and that mediate respon...
Daniel Grünbaum
TMC
2011
131views more  TMC 2011»
13 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
12 years 3 days ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström