Sciweavers

867 search results - page 44 / 174
» Network Robustness and Graph Topology
Sort
View
JAIR
2002
120views more  JAIR 2002»
13 years 7 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling
IROS
2009
IEEE
114views Robotics» more  IROS 2009»
14 years 2 months ago
A Distributed boundary detection algorithm for multi-robot systems
— We describe a distributed boundary detection algorithm suitable for use on multi-robot systems with dynamic network topologies. We assume that each robot has access to its loca...
James McLurkin, Erik D. Demaine
SENSYS
2004
ACM
14 years 1 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
MOBIHOC
2001
ACM
14 years 7 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
CHI
2011
ACM
12 years 11 months ago
Guess who?: enriching the social graph through a crowdsourcing game
Despite the tremendous popularity of social network sites both on the web and within enterprises, the relationship information they contain may be often incomplete or outdated. We...
Ido Guy, Adam Perer, Tal Daniel, Ohad Greenshpan, ...