2957 search results - page 529 / 592 » The Complexity of Polynomial-Time Approximation |
CGF
2010
13 years 4 months ago
2010
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
AI
2011
Springer
13 years 2 months 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...
CORR
2011
Springer
13 years 2 months 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...
DAM
2011
13 years 2 months 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...
ECCC
2011
13 years 2 months 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 ...