The top documents tagged [constant probability]

Devoxx Real-Time Learning
Technology Devoxx Real-Time Learning

141 views

Research Literature on Social Scores
Social Media Research Literature on Social Scores

106 views

Christian Sohler 1 HEINZ NIXDORF INSTITUT Universität Paderborn Algorithmen und Komplexität A Fast PTAS for k-Means Clustering Dan Feldman, Tel Aviv University,
Documents Christian Sohler 1 HEINZ NIXDORF INSTITUT Universität Paderborn Algorithmen und Komplexität A Fast PTAS for k-Means Clustering Dan Feldman, Tel Aviv University,

232 views

Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO Based on a paper in STOC, 2012
Documents Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO Based on a paper in STOC, 2012

215 views

Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO
Documents Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO

214 views

15. 05. 2007 Observational Learning in Random Networks Julian Lorenz, Martin Marciniszyn, Angelika Steger Institute of Theoretical Computer Science, ETH
Documents 15. 05. 2007 Observational Learning in Random Networks Julian Lorenz, Martin Marciniszyn, Angelika Steger Institute of Theoretical Computer Science, ETH

215 views

The Power of Unentanglement Scott Aaronson (MIT) Salman Beigi (MIT) Andrew Drucker (MIT) | Bill Fefferman (Caltech) Peter Shor (MIT) | |
Documents The Power of Unentanglement Scott Aaronson (MIT) Salman Beigi (MIT) Andrew Drucker (MIT) | Bill Fefferman (Caltech) Peter Shor (MIT) | |

223 views

The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT
Documents The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT

214 views

Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science
Documents Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science

216 views

The Average Case Complexity of Counting Distinct Elements David Woodruff IBM Almaden
Documents The Average Case Complexity of Counting Distinct Elements David Woodruff IBM Almaden

219 views

Optimal Bounds for Johnson- Lindenstrauss Transforms and Streaming Problems with Sub- Constant Error T.S. Jayram David Woodruff IBM Almaden
Documents Optimal Bounds for Johnson- Lindenstrauss Transforms and Streaming Problems with Sub- Constant Error T.S. Jayram David Woodruff IBM Almaden

214 views

Sublinear-time Algorithms for Machine Learning Ken Clarkson Elad Hazan David Woodruff IBM Almaden Technion IBM Almaden
Documents Sublinear-time Algorithms for Machine Learning Ken Clarkson Elad Hazan David Woodruff IBM Almaden Technion IBM Almaden

222 views