4866 search results - page 200 / 974 » UML for Global Computing |
136
click to vote
ICPADS
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
162
Voted
SAC
2012
ACM
14 years 5 days ago
2012
ACM
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the c...
153
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Stereo correspondence methods rely on matching costs for computing the similarity of image locations. In this paper we evaluate the insensitivity of different matching costs with ...
141
click to vote
CGF
2004
15 years 4 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
104
click to vote
ECEASST
2010
15 years 2 months ago
2010
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...