4212 search results - page 287 / 843 » On Compressible Pairings and Their Computation |
160
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
182
click to vote
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
The need to provide performance guarantee in high performance servers has long been neglected. Providing performance guarantee in current and future servers is difficult because ï...
163
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
191
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
228
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...