2652 search results - page 197 / 531 » Privacy-preserving linear programming |
118
click to vote
MST
2007
15 years 3 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
142
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
128
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
117
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
133
Voted
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...