Sciweavers

661 search results - page 7 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
JNW
2007
104views more  JNW 2007»
13 years 7 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
WSNA
2003
ACM
14 years 19 days ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
14 years 1 months ago
On frame and orientation localization for relative sensing networks
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
Giulia Piova, Iman Shames, Baris Fidan, Francesco ...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ALMOB
2008
85views more  ALMOB 2008»
13 years 7 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...