4843 search results - page 785 / 969 » The Shortcut Problem - Complexity and Approximation |
148
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
122
Voted
JSAC
2011
14 years 6 months ago
2011
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
133
click to vote
TON
2012
13 years 5 months ago
2012
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...
151
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...
262
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...