1023 search results - page 80 / 205 » Graph model selection using maximum likelihood |
STACS
2001
Springer
14 years 1 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper, a data-driven extension of the variational algorithm is proposed. Based on a few selected sensors, target tracking is performed distributively without any informati...
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
Color is a useful feature for machine vision tasks. However, its effectiveness is often limited by the fact that the measured pixel values in a scene are influenced by both object...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...