3894 search results - page 416 / 779 » Approximation Algorithms for Biclustering Problems |
144
click to vote
AAECC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
137
Voted
JMLR
2006
15 years 4 months ago
2006
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...
134
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
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 ...
131
Voted
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
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 ...
152
click to vote
FSTTCS
2003
Springer
15 years 10 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...