1023 search results - page 144 / 205 » Graph model selection using maximum likelihood |
138
click to vote
ESANN
2001
15 years 6 months ago
2001
Abstract. An approach to symbolic contour extraction will be described that consists of three stages: enhancement, detection, and extraction of edges and corners. Edges and corners...
154
click to vote
VLSISP
2002
15 years 4 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
145
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
150
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
171
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...