Sciweavers

774 search results - page 45 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
14 years 9 days ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
ECCV
2006
Springer
14 years 10 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr
ISSAC
2007
Springer
83views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Parallel computation of the rank of large sparse matrices from algebraic K-theory
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pasc...
IPPS
1999
IEEE
14 years 1 months ago
Sparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
Gerardo Bandera, Emilio L. Zapata
IJON
2008
116views more  IJON 2008»
13 years 8 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