Sciweavers

1986 search results - page 165 / 398
» Path Separability of Graphs
Sort
View
SOFSEM
2007
Springer
14 years 4 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
MOBICOM
2012
ACM
12 years 17 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ICDAR
2005
IEEE
14 years 3 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara
AINA
2003
IEEE
14 years 3 months ago
Detection of Multiple Bottleneck Bandwidth
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
14 years 3 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...