Sciweavers

7758 search results - page 122 / 1552
» On the Number of Distributive Lattices
Sort
View
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
14 years 1 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
WCE
2007
13 years 11 months ago
Distributed Self-Localisation in Sensor Networks using RIPS Measurements
Abstract—This paper develops an efficient distributed algorithm for localising motes in a large scale sensor network using radio interferometric positioning. The focus here is on...
Marcus Brazil, Mark R. Morelande, Bill Moran, D. A...
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 10 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
PODC
2006
ACM
14 years 4 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer

Publication
322views
14 years 2 months ago
Three-dimensional point cloud recognition via distributions of geometric distances
Ageometric framework for the recognition of three-dimensional objects represented by point clouds is introducedin this paper. The proposed approach is based on comparing distribut...
Mona Mahmoudi, Guillermo Sapiro