1389 search results - page 246 / 278 » Improved Approximation Algorithms for Label Cover Problems |
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
100
click to vote
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
The recently emerging WiMAX (IEEE 802.16) is a promising telecommunication technology to provide low-cost, high-speed and long-range wireless communications. To meet the growing de...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...