5580 search results - page 214 / 1116 » Randomized priority algorithms |
94
Voted
COMBINATORICS
2000
15 years 2 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
153
click to vote
MIR
2003
ACM
15 years 7 months ago
2003
ACM
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...
120
click to vote
ATS
2000
IEEE
15 years 6 months ago
2000
IEEE
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
113
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
141
Voted
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...