363 search results - page 23 / 73 » Decomposition of the NVALUE constraint |
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Nonnegative Tucker decomposition (NTD) is a recent multiway extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are incorporated into Tucker model...
JSAC
2006
14 years 9 months ago
2006
Abstract--Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful...
70
Voted
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...