81 search results - page 5 / 17 » On the probabilistic complexity of finding an approximate so... |
137
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
160
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
145
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
153
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
181
click to vote
TACAS
1998
Springer
15 years 8 months ago
1998
Springer
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...