Sciweavers

268 search results - page 26 / 54
» Growing Protean Graphs
Sort
View
KI
2010
Springer
14 years 8 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...
DAM
2007
107views more  DAM 2007»
15 years 1 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 1 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
CSJM
2006
76views more  CSJM 2006»
15 years 1 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
BMCBI
2007
134views more  BMCBI 2007»
15 years 2 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd