815 search results - page 123 / 163 » Approximate Entropy Reducts |
155
Voted
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
143
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
176
click to vote
FOCS
2008
IEEE
15 years 12 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:...
137
click to vote
VTC
2006
IEEE
15 years 11 months ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
152
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...