Sciweavers

16666 search results - page 26 / 3334
» Descriptive and Computational Complexity
Sort
View
78
Voted
CSL
2010
Springer
14 years 11 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CVIU
2004
125views more  CVIU 2004»
14 years 11 months ago
Automatic description of complex buildings from multiple images
We present an approach for detecting and describing complex buildings with flat or complex rooftops by using multiple, overlapping images of the scene. We find 3-D rooftop boundar...
Zu Whan Kim, Ramakant Nevatia
ISAAC
1992
Springer
82views Algorithms» more  ISAAC 1992»
15 years 3 months ago
Lowness and the Complexity of Sparse and Tally Descriptions
Vikraman Arvind, Johannes Köbler, Martin Mund...