Sciweavers

4911 search results - page 343 / 983
» Tree dependence analysis
Sort
View
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 5 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
IROS
2009
IEEE
111views Robotics» more  IROS 2009»
15 years 11 months ago
An exploration method for general robotic systems equipped with multiple sensors
Abstract— This paper presents a novel method for sensorbased exploration of unknown environments by a general robotic system equipped with multiple sensors. The method is based o...
Luigi Freda, Giuseppe Oriolo, Francesco Vecchioli
ICPR
2008
IEEE
15 years 11 months ago
A symbol graph based handwritten math expression recognition
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
Yu Shi, Frank K. Soong
ICPR
2008
IEEE
15 years 11 months ago
Tree-serial dynamic programming for image processing
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
Andrey Kopylov
CONEXT
2007
ACM
15 years 8 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt