Sciweavers

2519 search results - page 16 / 504
» Martingales and Locality in Distributed Computing
Sort
View
PERVASIVE
2004
Springer
14 years 2 months ago
A Distributed Precision Based Localization Algorithm for Ad-Hoc Networks
In this paper we introduce a new distributed algorithm for location discovery. It can be used in wireless ad-hoc sensor networks that are equipped with means of measuring the dista...
Leon Evers, Stefan Dulman, Paul J. M. Havinga
ALMOB
2006
80views more  ALMOB 2006»
13 years 8 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
PODC
2012
ACM
11 years 11 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
HPCA
2012
IEEE
12 years 4 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
WISEC
2010
ACM
14 years 1 months ago
Secure walking GPS: a secure localization and key distribution scheme for wireless sensor networks
In many applications of wireless sensor networks, sensor nodes are manually deployed in hostile environments where an attacker can disrupt the localization service and tamper with...
Qi Mi, John A. Stankovic, Radu Stoleru