Sciweavers

1080 search results - page 38 / 216
» The Complexity of Belief Update
Sort
View
ECCV
2006
Springer
16 years 8 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
ICASSP
2011
IEEE
14 years 10 months ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
WINET
2002
103views more  WINET 2002»
15 years 5 months ago
LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
Amiya Bhattacharya, Sajal K. Das
ISSPIT
2010
15 years 1 months ago
On the advantages of subspace tracking for temporal updating
When doing parameter estimation, ESPRIT is an often used algorithm. As input, ESPRIT needs the eigenvectors of the signal subspace. These can be generated by an eigenvalue decompos...
Matthias Lechtenberg, Jürgen Götze
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
Handling Model Changes: Regression Testing and Test-Suite Update with Model-Checkers
Several model-checker based methods to automated test-case generation have been proposed recently. The performance and applicability largely depends on the complexity of the model...
Gordon Fraser, Bernhard K. Aichernig, Franz Wotawa