21324 search results - page 376 / 4265 » Making the case for computing |
186
click to vote
STOC
1996
ACM
15 years 9 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...
135
Voted
ANTS
2006
Springer
15 years 8 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...
108
Voted
EOR
2002
15 years 4 months ago
2002
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
141
Voted
JSC
2010
15 years 3 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
113
Voted
INTERSPEECH
2010
14 years 11 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...