1439 search results - page 12 / 288 » Fast approximation of centrality |
SIGMOD
2005
ACM
14 years 11 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
RTA
2007
Springer
14 years 5 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
CVPR
2007
IEEE
15 years 28 days ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
RANDOM
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
