1120 search results - page 139 / 224 » Making computer science minority-friendly |
145
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
161
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
107
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
124
click to vote
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
Online Social Networks (OSN) are experiencing an explosive growth rate and are becoming an increasingly important part of people's lives. There is an increasing desire to aid ...
132
click to vote
EXPCS
2007
15 years 7 months ago
2007
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...