Sciweavers

1242 search results - page 51 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CHI
2009
ACM
15 years 10 months ago
Programming reality: from transitive materials to organic user interfaces
Over the past few years, a quiet revolution has been redefining our fundamental computing technologies. Flexible E-Ink, OLED displays, shape-changing materials, parametric design,...
Marcelo Coelho, Ivan Poupyrev, Sajid Sadi, Roel Ve...
TCS
2011
14 years 4 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
ATAL
2006
Springer
15 years 1 months ago
Complexity and succinctness of public announcement logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
Carsten Lutz
TIP
2010
176views more  TIP 2010»
14 years 4 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert