Sciweavers

56 search results - page 1 / 12
» On Matrix Representations of Participation Constraints
Sort
View
ER
2009
Springer
92views Database» more  ER 2009»
13 years 11 months ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 4 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
IJON
2008
116views more  IJON 2008»
13 years 5 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
SARA
2009
Springer
13 years 11 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
CVPR
2001
IEEE
14 years 7 months ago
Learning Spatially Localized, Parts-Based Representation
In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual pat...
Stan Z. Li, XinWen Hou, HongJiang Zhang, QianSheng...