2778 search results - page 99 / 556 » Limit complexities revisited |
138
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
160
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
118
click to vote
IPL
2007
15 years 4 months ago
2007
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
131
click to vote
CHI
1995
ACM
15 years 8 months ago
1995
ACM
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
147
Voted
WWW
2006
ACM
16 years 5 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...