1186 search results - page 143 / 238 » Improving Random Walk Performance |
109
click to vote
STOC
2012
ACM
13 years 9 days ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
CCS
2008
ACM
14 years 12 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
The goal of this paper is to study how a-prior knowledge of the image database could be exploited for better watermarking performance. Unlike most formulations, where the encoder ...
202
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....