1172 search results - page 137 / 235 » Path Algorithms on Regular Graphs |
IJRR
2000
15 years 13 days ago
2000
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path betwe...
85
Voted
SIBGRAPI
2000
IEEE
15 years 5 months ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of s...
115
click to vote
ADHOC
2005
15 years 16 days ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
97
Voted
DLT
2006
15 years 2 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
123
Voted
JMLR
2010
14 years 7 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...