9716 search results - page 202 / 1944 » The Case for Energy-Proportional Computing |
217
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
166
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
142
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
Last year, we showed that the computation of a GMM-UBMbased speaker verification (SV) system may be sped up by 30 times by using a high-density discrete model (HDDM) on the NIST 2...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
148
click to vote
FPL
2005
Springer
16 years 4 days ago
2005
Springer
We present experimental evidence that multiple compute-units, compiled from sequential high-level language input programs, can be merged into a reduced number of configurations f...