Sciweavers

1816 search results - page 140 / 364
» Trace oblivious computation
Sort
View
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 4 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
PDCAT
2005
Springer
14 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
ICPP
1999
IEEE
14 years 2 months ago
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
William Leinberger, George Karypis, Vipin Kumar
PODC
2010
ACM
14 years 2 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
CLUSTER
2001
IEEE
14 years 1 months ago
Semi-Continuous Transmission for Cluster-Based Video Servers
With advances in storage technology, the ability to provide client end storage for continuous media applications has become a possibility. Transmission of data in cluster based mu...
Sandy Irani, Nalini Venkatasubramanian