Sciweavers

Share
5 search results - page 1 / 1
» On the Number of Possible Row and Column Sums of 0, 1-Matric...
Sort
View
COMBINATORICS
2006
90views more  COMBINATORICS 2006»
9 years 3 hour ago
On the Number of Possible Row and Column Sums of 0, 1-Matrices
For n a positive integer, we show that the number of of 2n-tuples of integers that are the row and column sums of some n
Daniel Goldstein, Richard Stong
COCOON
2009
Springer
9 years 6 months ago
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
Ivona Bezáková, Nayantara Bhatnagar,...
ICFCA
2009
Springer
9 years 6 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
SPAA
2005
ACM
9 years 5 months ago
Finding effective support-tree preconditioners
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ra...
CORR
2008
Springer
110views Education» more  CORR 2008»
9 years 1 days ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
books