608 search results - page 24 / 122 » On Dependent Randomized Rounding Algorithms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
ISITA
2010
13 years 5 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
INFSOF
2008
13 years 7 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
COLING
1996
13 years 9 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...