Sciweavers

768 search results - page 26 / 154
» Asymptotic Cellular Complexity
Sort
View
GC
2011
Springer
14 years 1 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
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...
Michael Kerber, Michael Sagraloff
FGCS
2007
125views more  FGCS 2007»
14 years 9 months ago
An autonomic tool for building self-organizing Grid-enabled applications
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...
Gianluigi Folino, Giandomenico Spezzano
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
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...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
FUIN
2007
114views more  FUIN 2007»
14 years 9 months ago
Cellular Devices and Unary Languages
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...
Andreas Klein, Martin Kutrib
TWC
2008
77views more  TWC 2008»
14 years 9 months ago
Preamble-based cell identification for cellular OFDM systems
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...
Wooseok Nam, Yong Hoon Lee