4908 search results - page 127 / 982 » On the Complexity of Optimal K-Anonymity |
155
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
136
click to vote
GLOBECOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
179
click to vote
IJCV
2000
15 years 6 months ago
2000
Bayesian parameter estimation can be used to generate statistically optimal solutions to the problem of cue integration. However, the complexity and dimensionality of these solutio...
283
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
148
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...