10051 search results - page 225 / 2011 » A Dynamic Separator Algorithm |
161
click to vote
ALENEX
2004
15 years 7 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
180
click to vote
IROS
2008
IEEE
16 years 22 days ago
2008
IEEE
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
149
click to vote
WIA
2005
Springer
15 years 11 months ago
2005
Springer
The paper introduces a robust spelling correction technique to deal with ill-formed input strings, including unknown parts of unknown length. In contrast to previous works, we deri...
181
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
149
click to vote
WDAG
2009
Springer
16 years 28 days ago
2009
Springer
This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate tra...