13987 search results - page 100 / 2798 » The Two Guards Problem |
135
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
Slowdown, defined as the ratio of a request’s queueing delay to its service time, is accepted as an important quality of service metric of Internet servers. In this paper, we i...
140
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
140
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
113
click to vote
ASAP
2000
IEEE
15 years 7 months ago
2000
IEEE
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
106
click to vote
CTRSA
2008
Springer
15 years 5 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...