315 search results - page 3 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
DAC
1996
ACM
13 years 9 months ago
1996
ACM
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
IPL
2002
13 years 5 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
EUROPAR
1998
Springer
13 years 10 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...