Sciweavers

1528 search results - page 200 / 306
» On Signatures for Communication Graphs
Sort
View
PODC
2010
ACM
14 years 1 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
MOBICOM
2012
ACM
12 years 1 days ago
MARVEL: multiple antenna based relative vehicle localizer
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
Dong Li, Tarun Bansal, Zhixue Lu, Prasun Sinha
ECCV
2004
Springer
14 years 11 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
ICC
2009
IEEE
143views Communications» more  ICC 2009»
14 years 4 months ago
Low Complexity Markov Chain Monte Carlo Detector for Channels with Intersymbol Interference
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...
ISCC
2009
IEEE
254views Communications» more  ISCC 2009»
14 years 4 months ago
Monitoring connectivity in wireless sensor networks
It is important to have continuous connectivity in a wireless sensor network after it is deployed in a hostile environment. However, such networks are constrained by the low usert...
Benahmed Khelifa, Hafid Haffaf, Madjid Merabti, Da...