11345 search results - page 24 / 2269 » Foundations of Computer Science |
COMPGEOM
1992
ACM
13 years 11 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
CSCW
2000
ACM
13 years 7 months ago
2000
ACM
This paper asks the question: how might CSCW system design obtain and be informed by an adequate real-world, real-time understanding of work and organisation on any occasion of wor...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...