10988 search results - page 40 / 2198 » Algorithmic Folding Complexity |
129
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
133
click to vote
ACL
2006
15 years 3 months ago
2006
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
126
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
157
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
124
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...