10988 search results - page 2042 / 2198 » Algorithmic Folding Complexity |
130
click to vote
BIRD
2008
Springer
15 years 5 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
104
click to vote
CCS
2008
ACM
15 years 5 months ago
2008
ACM
In content-driven reputation systems for collaborative content, users gain or lose reputation according to how their contributions fare: authors of long-lived contributions gain r...
131
Voted
CHES
2008
Springer
15 years 5 months ago
2008
Springer
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...
141
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
121
Voted
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...