71 search results - page 15 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...