58 search results - page 11 / 12 » Sparse Coding with Invariance Constraints |
ECOOP
2012
Springer
11 years 9 months ago
2012
Springer
X10 is an object oriented programming language with a sophisticated type system (constraints, class invariants, non-erased generics, closures) and concurrency constructs (asynchron...
AI
2006
Springer
13 years 7 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...
JSAC
2011
13 years 2 months ago
2011
This paper investigates the issue of dynamic resource allocation (DRA) in the context of multiuser cognitive radio networks. We present a general framework adopting generalized si...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...