Sciweavers

6365 search results - page 201 / 1273
» Fast Local Computation Algorithms
Sort
View
IPL
2011
91views more  IPL 2011»
14 years 9 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
CF
2005
ACM
15 years 8 months ago
Marching-pixels: a new organic computing paradigm for smart sensor processor arrays
In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based...
Dietmar Fey, Daniel Schmidt 0003
ICASSP
2011
IEEE
14 years 10 months ago
Cooperative mobile network localization via subspace tracking
Two novel cooperative localization algorithms for mobile wireless networks are proposed. To continuously localize the mobile network, given the pairwise distance measurements betw...
Hadi Jamali Rad, Alon Amar, Geert Leus
158
Voted
ICCS
2009
Springer
16 years 26 days ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka
ICRA
2009
IEEE
155views Robotics» more  ICRA 2009»
16 years 29 days ago
Simultaneous localization of mobile robot and multiple sound sources using microphone array
Sound source localization is an important function in robot audition. The existing works perform sound source localization using static microphone arrays. This work proposes a fram...
Jwu-Sheng Hu, Chen-Yu Chan, Cheng-Kang Wang, Chieh...