119 search results - page 22 / 24 » stoc 2010 |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...