17366 search results - page 223 / 3474 » New Revision Algorithms |
168
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
160
click to vote
INFOCOM
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper, we propose and study a new technique, which we call cache-based compaction for reducing the latency of Web browsing over a slow link. Our compaction technique trades...
152
click to vote
SIGGRAPH
1994
ACM
15 years 9 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
149
click to vote
DAWAK
2006
Springer
15 years 9 months ago
2006
Springer
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
150
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...