85
Voted
CORR
2004
Springer
15 years 7 days ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
135
click to vote
COMGEO
2004
ACM
15 years 7 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
114
Voted
COMGEO
2004
ACM
15 years 7 days ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
94
Voted
COMGEO
2004
ACM
15 years 7 days ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
105
click to vote
COMCOM
2004
15 years 7 days ago
2004
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
86
Voted
COMCOM
2004
15 years 7 days ago
2004
We propose two flow control algorithms for networks with multiple paths between each source
COMBINATORICS
2004
15 years 7 days ago
2004
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
CJ
2004
15 years 7 days ago
2004
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n
98
Voted
CGF
2004
15 years 7 days ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
114
Voted
CGF
2004
15 years 7 days ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...