4934 search results - page 179 / 987 » complexity 2008 |
138
click to vote
DM
2002
15 years 4 months ago
2002
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
141
Voted
COLING
1990
15 years 5 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
122
click to vote
IPL
2007
15 years 4 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
129
Voted
TIP
2002
15 years 4 months ago
2002
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
123
click to vote
TIT
2010
14 years 11 months ago
2010
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...