4428 search results - page 258 / 886 » The Chow Parameters Problem |
159
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
176
click to vote
ISAAC
2010
Springer
15 years 3 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
163
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
146
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
206
click to vote
ECCV
2004
Springer
16 years 7 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...