5981 search results - page 1116 / 1197 » time 2006 |
177
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
167
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
168
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
188
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
180
click to vote
GLOBECOM
2006
IEEE
16 years 26 days ago
2006
IEEE
— The joint cooperative processing of transmitted signal from several multiple-input multiple-output (MIMO) base station (BS) antenna heads is considered for users located within...