Sciweavers

13603 search results - page 143 / 2721
» On the Complexity of Computing Treelength
Sort
View
SIAMMAX
2011
180views more  SIAMMAX 2011»
13 years 4 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
MOC
1998
93views more  MOC 1998»
13 years 9 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
FPL
2010
Springer
188views Hardware» more  FPL 2010»
13 years 7 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
13 years 14 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown