3894 search results - page 505 / 779 » Approximation Algorithms for Biclustering Problems |
127
click to vote
ECCC
2007
15 years 4 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
110
click to vote
PR
2000
15 years 4 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
141
Voted
TFS
2008
15 years 3 months ago
2008
Abstract--Since the fuzzy cerebellar model articulation controller (FCMAC) uses linguistic variables, it is highly intuitive and easily comprehended. Despite the FCMAC's good ...
129
click to vote
COMPUTING
2010
15 years 1 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
158
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...