1399 search results - page 223 / 280 » Multi-party Finite Computations |
135
click to vote
CPHYSICS
2010
15 years 4 months ago
2010
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
119
click to vote
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
131
click to vote
CSDA
2008
15 years 4 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
137
click to vote
EOR
2010
15 years 4 months ago
2010
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...