Sciweavers

5372 search results - page 155 / 1075
» complexity 2007
Sort
View
AIMS
2007
Springer
14 years 2 months ago
Graph Models of Critical Infrastructure Interdependencies
Critical infrastructures are interconnected on multiple levels, and due to their size models with acceptable computational complexity and adequate modeling capacities must be devel...
Nils Kalstad Svendsen, Stephen D. Wolthusen
JALC
2007
84views more  JALC 2007»
13 years 7 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
NAACL
2003
13 years 9 months ago
Unsupervised Learning of Morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
Howard Johnson, Joel D. Martin
ICC
2007
IEEE
110views Communications» more  ICC 2007»
14 years 2 months ago
Performance of Interleave Division Multiple Access Based on Minimum Mean Square Error Detection
— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
Katsutoshi Kusume, Guido Dietl, Wolfgang Utschick,...
DAM
2007
77views more  DAM 2007»
13 years 8 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban