5084 search results - page 605 / 1017 » Proving Possibility Properties |
184
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
169
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both wi...
139
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
166
click to vote
CTRSA
2008
Springer
15 years 8 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...
172
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
We consider a distributed system that disseminates highvolume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we...