2084 search results - page 151 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
171
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
136
click to vote
MA
2010
Springer
15 years 3 months ago
2010
Springer
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
146
click to vote
STOC
1994
ACM
15 years 9 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
165
Voted
NIPS
2007
15 years 6 months ago
2007
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
176
click to vote
ICC
2011
IEEE
14 years 4 months ago
2011
IEEE
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...