Sciweavers

1068 search results - page 95 / 214
» Factorization as a Rank 1 Problem
Sort
View
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
15 years 4 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
14 years 11 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
HPCC
2007
Springer
15 years 4 months ago
Optimizing Array Accesses in High Productivity Languages
One of the outcomes of DARPA’s HPCS program has been the creation of three new high productivity languages: Chapel, Fortress, and X10. While these languages have introduced impro...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
CASES
2006
ACM
15 years 1 months ago
Reaching fast code faster: using modeling for efficient software thread integration on a VLIW DSP
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...
Won So, Alexander G. Dean
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
15 years 11 months ago
Effective Computation of Biased Quantiles over Data Streams
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...