2397 search results - page 135 / 480 » Applications of integer relation algorithms |
158
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
209
click to vote
IJNSEC
2010
15 years 1 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
170
click to vote
IMC
2006
ACM
16 years 12 days ago
2006
ACM
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
163
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
174
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...