Sciweavers

169 search results - page 23 / 34
» Counting paths in digraphs
Sort
View
CLUSTER
2002
IEEE
13 years 8 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
CCCG
2010
13 years 6 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick
ICML
2003
IEEE
14 years 9 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
IROS
2009
IEEE
191views Robotics» more  IROS 2009»
14 years 3 months ago
Non-cubic occupied voxel lists for robot maps
— An alternative to the conventional quantization for occupied voxel lists in both 2D and 3D is presented. The performance metrics of the hexagonal lattice in 2D and the face cen...
Julian Ryde, Michael Brünig
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
14 years 3 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle