1192 search results - page 218 / 239 » Computing Weakest Readings |
110
Voted
WWW
2007
ACM
16 years 2 months ago
2007
ACM
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
106
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
116
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
Currently, the vast majority of web sites do not support accessibility for visually impaired users. Usually, these users have to rely on screen readers: applications that sequenti...
226
Voted
POPL
2009
ACM
16 years 2 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
245
Voted
ASPLOS
2009
ACM
16 years 2 months ago
2009
ACM
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...