Sciweavers

39 search results - page 8 / 8
» Better approximation algorithms for bin covering
Sort
View
91
Voted
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
15 years 10 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
113
Voted
BMCBI
2010
138views more  BMCBI 2010»
14 years 9 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 3 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
COMSWARE
2007
IEEE
15 years 1 months ago
Efficient Design of End-to-End Probes for Source-Routed Networks
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...
Srinivasan Parthasarathya, Rajeev Rastogi, Marina ...