16666 search results - page 412 / 3334 » Descriptive and Computational Complexity |
190
click to vote
FCT
2007
Springer
16 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
ICCS
2004
Springer
16 years 7 days ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
157
click to vote
IWPEC
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
198
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
194
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...