1541 search results - page 122 / 309 » Analysis of Random Noise and Random Walk Algorithms |
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which co...
137
click to vote
PAKDD
2001
ACM
15 years 9 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
154
click to vote
FGCS
2010
15 years 3 months ago
2010
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
183
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
150
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...