19866 search results - page 219 / 3974 » Computing all factorizations in *** |
156
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
138
click to vote
EJC
2007
15 years 6 months ago
2007
: We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct f...
164
click to vote
TC
1998
15 years 6 months ago
1998
In [1], Duprat and Muller introduced the ingenious “Branching CORDIC” algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a consta...
163
click to vote
PPAM
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
164
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Genome sequencing projects have expanded the gap between the amount of known protein sequences and structures. The limitations of current high resolution structure det...