Sciweavers

433 search results - page 64 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
FOCS
2007
IEEE
15 years 8 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
SIGCOMM
2006
ACM
15 years 7 months ago
SybilGuard: defending against sybil attacks via social networks
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...
Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, ...
130
Voted
CLOUD
2010
ACM
15 years 7 months ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
CP
2006
Springer
15 years 5 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
95
Voted
ANOR
2007
126views more  ANOR 2007»
15 years 2 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey