768 search results - page 26 / 154 » Asymptotic Cellular Complexity |
GC
2011
Springer
12 years 11 months ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
FGCS
2007
13 years 7 months ago
2007
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
FUIN
2007
13 years 7 months ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
TWC
2008
13 years 7 months ago
2008
Preamble-based cell identification (CID) schemes are derived for orthogonal frequency division multiplexing (OFDM) systems. They include the optimal schemes based on the Bayesian a...