5580 search results - page 288 / 1116 » Randomized priority algorithms |
186
click to vote
VLSID
2005
IEEE
16 years 1 days ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
191
click to vote
CHES
2005
Springer
16 years 23 hour ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
158
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
154
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
197
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...