Sciweavers

1404 search results - page 32 / 281
» Complexity of admissible rules
Sort
View
JAC
2008
13 years 11 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
CRITIS
2006
14 years 2 months ago
Trust Establishment in Ad Hoc and Sensor Networks
Ad hoc and sensor networks highly depend on the distributed cooperation among network nodes. Trust establishment frameworks provide the means for representing, evaluating, maintain...
Efthimia Aivaloglou, Stefanos Gritzalis, Charalabo...
TNN
2008
102views more  TNN 2008»
13 years 10 months ago
A Class of Complex ICA Algorithms Based on the Kurtosis Cost Function
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
Hualiang Li, Tülay Adali
ICALP
2009
Springer
14 years 10 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
DEBS
2008
ACM
14 years 3 days ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch