Sciweavers

10 search results - page 1 / 2
» Towards Exact Localization without Explicit Localization wit...
Sort
View
48
Voted
ICRA
1998
IEEE
62views Robotics» more  ICRA 1998»
15 years 2 months ago
Towards Exact Localization without Explicit Localization with the Generalized Voronoi Graph
Keiji Nagatani, Howie Choset, Sebastian Thrun
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ESSLLI
1999
Springer
15 years 2 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau