9997 search results - page 241 / 2000 » The case for crowd computing |
121
click to vote
EOR
2002
15 years 6 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) ...
157
click to vote
JSC
2010
15 years 4 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...
134
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...
165
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...
137
click to vote
FPL
2005
Springer
15 years 11 months 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...