4843 search results - page 233 / 969 » The Shortcut Problem - Complexity and Approximation |
139
Voted
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
140
Voted
ICC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
229
Voted
CVPR
2010
IEEE
14 years 23 days ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
151
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
106
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...