Ashok Kumar Ponnuswami

According to our database, Ashok Kumar Ponnuswami authored at least 8 papers between 2004 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

Model characterization curves for federated search using click-logs: predicting user engagement metrics for the span of feasible operating points.

Ashok Kumar Ponnuswami, Kumaresh Pattabiraman, Desmond Brand, Tapas Kanungo

Proceedings of the 20th International Conference on World Wide Web, 2011

On composition of a federated web search result page: using online users to provide pairwise preference for heterogeneous verticals.

Ashok Kumar Ponnuswami, Kumaresh Pattabiraman, Qiang Wu, Ran Gilad-Bachrach, Tapas Kanungo

Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

2009

On Agnostic Learning of Parities, Monomials, and Halfspaces.

Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami

SIAM J. Comput., 2009

2008

Minimizing Wide Range Regret with Time Selection Functions.

Subhash Khot, Ashok Kumar Ponnuswami

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Approximation Algorithms for the Max-Min Allocation Problem.

Subhash Khot, Ashok Kumar Ponnuswami

Proceedings of the Approximation, 2007

2006

New Results for Learning Noisy Parities and Halfspaces.

Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami

Electron. Colloquium Comput. Complex., 2006

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion.

Subhash Khot, Ashok Kumar Ponnuswami

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2004

Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.

Ashok Kumar Ponnuswami, H. Venkateswaran

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004