1554 search results - page 200 / 311 » Parameterized Complexity and Approximation Algorithms |
151
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
143
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
134
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— The capacity of multiple input multiple output (MIMO) system over wireless channels has been investigated analytically and by simulation over different types of wireless fading...
130
click to vote
WINE
2009
Springer
15 years 7 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
120
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...