19320 search results - page 3671 / 3864 » On the complexity of computing determinants |
162
Voted
CCGRID
2002
IEEE
15 years 10 months ago
2002
IEEE
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
169
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
158
click to vote
GMP
2002
IEEE
15 years 10 months ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
149
Voted
HICSS
2002
IEEE
15 years 10 months ago
2002
IEEE
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
175
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...