2040 search results - page 357 / 408 » Approximate Expectation Maximization |
115
click to vote
SSDBM
2010
IEEE
14 years 10 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
142
click to vote
COMGEO
2012
ACM
13 years 8 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
106
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
134
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
88
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper a probabilistic technique for compensation of intensity loss in the confocal microscopy images is presented. Confocal microscopy images are modeled as a mixture of t...