251 search results - page 17 / 51 » Constructive Linear Time Algorithms for Branchwidth |
PR
2007
14 years 11 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
DAM
2000
14 years 11 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
97
Voted
ALENEX
2007
15 years 1 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
101
click to vote
NETWORK
2011
14 years 6 months ago
2011
Inferring the subjective perception of a video stream in real time continues to be a stiff problem. This article presents MintMOS: a lightweight, no-reference, loadable kernel mod...
ALENEX
2010
15 years 1 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...