29908 search results - page 5652 / 5982 » On the complexity of communication complexity |
197
click to vote
CCCG
2008
15 years 8 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
198
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
iary models in order to bridge the semantic gap between high-level, abstract user requirements and low-level, concrete programs and to support a stepwise refinement process. This d...
225
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
208
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
206
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...