Sciweavers

1302 search results - page 121 / 261
» On the Strong Chromatic Number
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 6 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ICFP
2008
ACM
16 years 6 months ago
Quotient lenses
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C...
ECIR
2009
Springer
16 years 3 months ago
Correlation of Term Count and Document Frequency for Google N-Grams
For bounded datasets such as the TREC Web Track (WT10g) the computation of term frequency (TF) and inverse document frequency (IDF) is not difficult. However, when the corpus is th...
Martin Klein, Michael L. Nelson
STORAGESS
2006
ACM
16 years 13 days ago
Scalable security for large, high performance storage systems
New designs for petabyte-scale storage systems are now capable of transferring hundreds of gigabytes of data per second, but lack strong security. We propose a scalable and effici...
Andrew W. Leung, Ethan L. Miller
PET
2010
Springer
15 years 10 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg