38 search results - page 2 / 8 » Love Conquers All |
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
TALG
2008
13 years 7 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
RSS
2007
13 years 8 months ago
2007
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Grid applications need to be fault tolerant, malleable, and migratable. In previous work, we have presented orphan saving, an efficient mechanism addressing these issues for divide...
COSIT
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give ...