630 search results - page 62 / 126 » Hardness results for approximating the bandwidth |
112
click to vote
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
105
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
111
Voted
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
119
click to vote
ACL
2007
15 years 2 months ago
2007
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate s...
114
Voted
GRAMMARS
1998
15 years 8 days ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...