5153 search results - page 240 / 1031 » Introduction to Randomized Algorithms |
122
Voted
COCO
2003
Springer
15 years 8 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} ...
120
Voted
SIGMOD
1999
ACM
15 years 7 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 ...
150
click to vote
CIKM
2008
Springer
15 years 5 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...
138
Voted
DCG
2008
15 years 3 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
117
Voted
ACL
2009
15 years 1 months ago
2009
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...