Sciweavers

2487 search results - page 98 / 498
» Partitions of Graphs into Trees
Sort
View
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
14 years 4 months ago
A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
Stephen Tully, George Kantor, Howie Choset, Felix ...
PAKDD
2004
ACM
108views Data Mining» more  PAKDD 2004»
14 years 3 months ago
A Metric Approach to Building Decision Trees Based on Goodman-Kruskal Association Index
We introduce a numerical measure on sets of partitions of finite sets that is linked to the Goodman-Kruskal association index commonly used in statistics. This measure allows us t...
Dan A. Simovici, Szymon Jaroszewicz
CSR
2009
Springer
14 years 1 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
DM
2002
104views more  DM 2002»
13 years 9 months ago
Graphs induced by Gray codes
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
Elizabeth L. Wilmer, Michael D. Ernst
BDA
2004
13 years 11 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...