Sciweavers

2050 search results - page 108 / 410
» constraints 2010
Sort
View
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 1 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
TAICPART
2010
IEEE
166views Education» more  TAICPART 2010»
15 years 2 months ago
Linguistic Security Testing for Text Communication Protocols
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
Ben W. Y. Kam, Thomas R. Dean
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 2 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
JMLR
2010
153views more  JMLR 2010»
14 years 11 months ago
Generalized Expectation Criteria for Semi-Supervised Learning with Weakly Labeled Data
In this paper, we present an overview of generalized expectation criteria (GE), a simple, robust, scalable method for semi-supervised training using weakly-labeled data. GE fits m...
Gideon S. Mann, Andrew McCallum
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 4 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke