Sciweavers

CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 9 months ago
Simple Distributed Weighted Matchings
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...
Jaap-Henk Hoepman
COMGEO
2004
ACM
13 years 9 months ago
A local search approximation algorithm for k-means clustering
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...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
COMGEO
2004
ACM
13 years 9 months ago
A multi-dimensional approach to force-directed layouts of large graphs
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...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
COMGEO
2004
ACM
13 years 9 months ago
On simplifying dot maps
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...
Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat ...
COMCOM
2004
117views more  COMCOM 2004»
13 years 9 months ago
Dynamic bandwidth allocation in multi-class connection-oriented networks
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...
Samer Taha, Mohsen Kavehrad
COMCOM
2004
78views more  COMCOM 2004»
13 years 9 months ago
Performance and control of network systems
We propose two flow control algorithms for networks with multiple paths between each source
Robert D. van der Mei, Frank Huebner
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
13 years 9 months ago
A Fast Algorithm for MacMahon's Partition Analysis
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...
Guoce Xin
CJ
2004
110views more  CJ 2004»
13 years 9 months ago
Efficient Parallel Algorithms for Euclidean Distance Transform
A parallel algorithm for Euclidean Distance Transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n
Ling Chen, Yi Pan, Yixin Chen, Xiao-hua Xu
CGF
2004
127views more  CGF 2004»
13 years 9 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
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...
Sébastien Valette, Jean-Marc Chassery
CGF
2004
175views more  CGF 2004»
13 years 9 months ago
DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
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...
Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha