Sciweavers

75 search results - page 5 / 15
» An improved bound for the monochromatic cycle partition numb...
Sort
View
PIMRC
2008
IEEE
15 years 4 months ago
Comparative performance evaluation of MAC protocols in ad hoc networks with bandwidth partitioning
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
Mariam Kaynia, Geir E. Øien, Nihar Jindal, ...
APDC
1997
14 years 11 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
PRL
2008
135views more  PRL 2008»
14 years 9 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
GD
2004
Springer
15 years 3 months ago
Intersection Reverse Sequences and Geometric Applications
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
Adam Marcus, Gábor Tardos
CASES
2003
ACM
15 years 2 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara