1355 search results - page 187 / 271 » Alternating Timed Automata over Bounded Time |
143
Voted
SSD
2001
Springer
15 years 7 months ago
2001
Springer
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
143
Voted
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
134
Voted
OPODIS
2003
15 years 4 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
163
Voted
WACV
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper describes a new method to improve inertial navigation using feature-based constraints from one or more video cameras. The proposed method lengthens the period of tim...
136
click to vote
DAM
2010
15 years 3 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...