Sciweavers

768 search results - page 17 / 154
» Asymptotic Cellular Complexity
Sort
View
CIT
2006
Springer
13 years 11 months ago
A High Performance ASIC for Cellular Automata (CA) Applications
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
Cheryl A. Kincaid, Saraju P. Mohanty, Armin R. Mik...
IJCGA
2007
44views more  IJCGA 2007»
13 years 7 months ago
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, ...
GRAPHICSINTERFACE
1996
13 years 9 months ago
Fast Rendering of Complex Environments Using a Spatial Hierarchy
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...
Bradford L. Chamberlain, Tony DeRose, Dani Lischin...
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
13 years 5 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu
FAW
2009
Springer
144views Algorithms» more  FAW 2009»
14 years 6 days ago
Communication Complexity and Its Applications
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andrew Chi-Chih Yao