37 search results - page 5 / 8 » A New Framework for Approximate Labeling via Graph Cuts |
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
COLING
2010
13 years 2 months ago
2010
Multi-document summarization aims to distill the most important information from a set of documents to generate a compressed summary. Given a sentence graph generated from a set o...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...