6365 search results - page 289 / 1273 » Fast Local Computation Algorithms |
203
click to vote
AAECC
2003
Springer
15 years 10 months ago
2003
Springer
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
168
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
184
click to vote
SAT
2005
Springer
16 years 4 days ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
192
Voted
IWDW
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate ...
155
Voted
CALC
2001
Springer
15 years 11 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...