Sciweavers

3874 search results - page 408 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ICALP
2004
Springer
16 years 2 days ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
16 years 1 days ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
FSTTCS
2003
Springer
15 years 12 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
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...
Yuk Hei Chan, Lap Chi Lau