620 search results - page 110 / 124 » A Simple and Fast Min-cut Algorithm |
121
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
ASPLOS
2010
ACM
15 years 6 months ago
2010
ACM
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
100
click to vote
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
EUROGRAPHICS
2010
Eurographics
15 years 26 days ago
2010
Eurographics
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
121
click to vote
KAIS
2011
14 years 6 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...