7006 search results - page 996 / 1402 » Approximation Algorithms |
220
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
204
click to vote
TCBB
2011
15 years 1 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
180
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
188
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider a visual scene analysis scenario where objects (e.g. people, cars) pass through the viewing field of a static camera and need to be detected and segmented from the bac...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...