#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1978

2014

- This year (0)
- Last 5 years (5)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jon Feldman, Martin J. Wainwright, David R. Karger
- IEEE Transactions on Information Theory
- 2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The decoding algorithm is based on a linear programming (LP) relaxation that is defined by a factor graph or parity-check representation of the code. The resulting… (More)

- Jon Feldman
- 2003

- Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein
- SIGCOMM
- 2006

Sensor networks are especially useful in catastrophic or emergency scenarios such as floods, fires, terrorist attacks or earthquakes where human participation may be too dangerous. However, such disaster scenarios pose an interesting design challenge since the sensor nodes used to collect and communicate data may themselves fail suddenly and unpredictably,… (More)

- Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan
- 2009 50th Annual IEEE Symposium on Foundations of…
- 2009

We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result of Karp, Vazirani and Vazirani gives an approximation ratio of $1-{1\over e} \simeq 0.632$, a very familiar bound that holds for many online problems; further, the bound is tight… (More)

- Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright
- IEEE Transactions on Information Theory
- 2007

We show that for low-density parity-check (LDPC) codes whose Tanner graphs have sufficient expansion, the linear programming (LP) decoder of Feldman, Karger, and Wainwright can correct a constant fraction of errors. A random graph will have sufficient expansion with high probability, and recent work shows that such graphs can be constructed efficiently. A… (More)

- Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor
- J. Graph Algorithms Appl.
- 2001

Divide-and-conquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and " glue " the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive partitioning of the subproblems. At each internal node of the… (More)

- Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál
- WINE
- 2008

Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auction for sponsored search is the " Generalized Second Price " (GSP) auction where advertisers are assigned to slots in the decreasing order of their score, which is defined as the product of… (More)

- Jon Feldman, Matthias Ruhl
- SIAM J. Comput.
- 1999

We consider the DIRECTED STEINER NETWORK problem , also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s 1 ,t 1),. .. , (s p ,t p)} of nodes in the graph, one has to find the smallest subgraph H of G that contains paths from s i to t i for all i. The problem is NP-hard for general p, since the DIRECTED STEINER… (More)

- Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
- ACM Trans. Algorithms
- 2008

A common approach for dealing with large datasets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive datasets, however, even making a single pass over the data is prohibitive. Therefore, streaming computations must be distributed over many machines. In practice, obtaining significant speedups using… (More)

We consider the problem of using a multicast network code to transmit information securely in the presence of a " wire-tap " adversary who can eavesdrop on a bounded number of network edges. Cai & Yeung (ISIT, 2002) gave a method to alter any given linear network code into a new code that is secure. However, their construction is in general inefficient, and… (More)