FOCS
2009
IEEE
13 years 2 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 2 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
FOCS
2009
IEEE
13 years 8 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 8 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
FOCS
2009
IEEE
13 years 8 months ago
2009
IEEE
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...