7106 search results - page 389 / 1422 » Restricted Complexity, General Complexity |
180
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
153
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
156
click to vote
ECTEL
2007
Springer
16 years 1 months ago
2007
Springer
Project-centred learning is increasingly used both in academia and in companies; universities train students to master complex tasks, often suggested by real-life situations, while...
169
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
211
click to vote
LICS
2006
IEEE
16 years 26 days ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...