2957 search results - page 329 / 592 » The Complexity of Polynomial-Time Approximation |
193
click to vote
STACS
2005
Springer
16 years 2 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
189
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
198
click to vote
CVPR
2003
IEEE
16 years 8 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. ...
203
click to vote
CVPR
2005
IEEE
16 years 8 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...
198
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...