1066 search results - page 45 / 214 » Computing Private Set Operations with Linear Complexities |
104
click to vote
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
SC
2004
ACM
15 years 3 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
GD
2004
Springer
15 years 3 months ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
105
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...