2374 search results - page 177 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
132
Voted
SPIN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
122
Voted
SIGGRAPH
1992
ACM
15 years 6 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
104
Voted
ICPR
2002
IEEE
15 years 7 months ago
2002
IEEE
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
218
Voted
SPAA
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
147
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...