2520 search results - page 441 / 504 » The complexity of approximating entropy |
169
Voted
AI
2011
Springer
15 years 18 days ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
161
Voted
CORR
2011
Springer
15 years 16 days ago
2011
Springer
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
149
click to vote
DAM
2011
15 years 16 days ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
301
click to vote
ECCC
2011
15 years 15 days ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
155
click to vote
SIAMNUM
2011
15 years 14 days ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...