335 search results - page 54 / 67 » Non-negative sparse coding |
117
click to vote
ESSMAC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
89
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
83
Voted
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
FASE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...