Sciweavers

12825 search results - page 1882 / 2565
» Improved PLSOM algorithm
Sort
View
WWW
2004
ACM
16 years 8 months ago
Efficient web change monitoring with page digest
The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is...
David Buttler, Daniel Rocco, Ling Liu
WWW
2002
ACM
16 years 8 months ago
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
Taher H. Haveliwala
231
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
251
Voted
PPOPP
2009
ACM
16 years 7 months ago
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
Muthu Manikandan Baskaran, Nagavijayalakshmi Vydya...
207
Voted
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 7 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
« Prev « First page 1882 / 2565 Last » Next »